424 search results - page 23 / 85 » A Lambda Calculus with Forms |
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...
PPDP
2005
Springer
14 years 1 months ago
2005
Springer
Huet and Lang (1978) presented a framework of automated program transformation based on lambda calculus in which programs are transformed according to a given program transformati...
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
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
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...