Daniel Seidel

According to our database1, Daniel Seidel
  • authored at least 16 papers between 2009 and 2015.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2015
Targeted jumping of compliantly actuated hoppers based on discrete planning and switching control.
Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2015

2014
Parametricity and Proving Free Theorems for Functional-Logic Languages.
Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming, 2014

Model-free path planning for redundant robots using sparse data from kinesthetic teaching.
Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014

2013
Free theorems in languages with real-world programming features.
PhD thesis, 2013

A semantics for weakly encapsulated search in functional logic programs.
Proceedings of the 15th International Symposium on Principles and Practice of Declarative Programming, 2013

2012
Countable homogeneous multipartite graphs.
Eur. J. Comb., 2012

2011
Improvements for Free
Proceedings of the Proceedings Ninth Workshop on Quantitative Aspects of Programming Languages, 2011

Refined typing to localize the impact of forced strictness on free theorems.
Acta Inf., 2011

Minimally strict polymorphic functions.
Proceedings of the 13th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2011

Strictification of circular programs.
Proceedings of the 2011 ACM SIGPLAN Workshop on Partial Evaluation and Program Manipulation, 2011

2010
An Adequate, Denotational, Functional-Style Semantics for Typed FlatCurry.
Proceedings of the Functional and Constraint Logic Programming, 2010

Proving Properties about Functions on Lists Involving Element Tests.
Proceedings of the Recent Trends in Algebraic Development Techniques, 2010

Free theorems for functional logic programs.
Proceedings of the 4th ACM Workshop Programming Languages meets Program Verification, 2010

Automatically Generating Counterexamples to Naive Free Theorems.
Proceedings of the Functional and Logic Programming, 10th International Symposium, 2010

2009
Free theorems for functional logic programs: (abstract only).
SIGPLAN Notices, 2009

Taming Selective Strictness.
Proceedings of the Informatik 2009: Im Focus das Leben, 2009


  Loading...