136 search results - page 18 / 28 » Proving Properties of Lazy Functional Programs with Sparkle |
APLAS
2005
ACM
14 years 4 months ago
2005
ACM
Interpretation interpretation is a theory of effective abstraction and/or approximation of discrete mathematical structures as found in the semantics of programming languages, mod...
MPC
2010
Springer
14 years 3 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...
FCT
2005
Springer
14 years 4 months ago
2005
Springer
We prove optimal lower bounds for multilinear circuits and for monotone circuits with bounded depth. These lower bounds state that, in order to compute certain functions, these cir...
AC
2000
Springer
14 years 3 months ago
2000
Springer
In these notes, we give an overview of the join calculus, its semantics, and its equational theory. The join calculus is a language that models distributed and mobile programming. ...
AAECC
2007
Springer
13 years 11 months ago
2007
Springer
We enhance the dependency pair method in order to prove termination using recursive structure analysis in simply-typed term rewriting systems, which is one of the computational mod...