233 search results - page 10 / 47 » Computational Lambda-Calculus and Monads |
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. The dependency core calculus (DCC), a simple extension of the computational lambda calculus, captures a common notion of dependency that arises in many programming langua...
POPL
2008
ACM
14 years 7 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
We introduce a new kind of tree automaton, a dependency tree automaton, that is suitable for deciding properties of classes of terms with binding. Two kinds of such automaton are d...
APAL
2000
13 years 7 months ago
2000
It is shown how to restrict recursion on notation in all finite types so as to characterize the polynomial time computable functions. The restrictions are obtained by using a rami...
ICFP
2009
ACM
14 years 8 months ago
2009
ACM
re a popular form of abstract computation. Being more general than monads, they are more broadly applicable, and in parare a good abstraction for signal processing and dataflow co...