Sciweavers

424 search results - page 23 / 85
» A Lambda Calculus with Forms
Sort
View
ICFP
2009
ACM
16 years 6 months ago
Causal commutative arrows and their optimization
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...
Hai Liu, Eric Cheng, Paul Hudak
PPDP
2005
Springer
15 years 11 months ago
Program transformation by templates based on term rewriting
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...
Yuki Chiba, Takahito Aoto, Yoshihito Toyama
279
Voted
POPL
2008
ACM
16 years 5 months ago
A logical account of pspace
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...
Marco Gaboardi, Jean-Yves Marion, Simona Ronchi De...
137
Voted
FOSSACS
2010
Springer
16 years 13 days ago
Monads Need Not Be Endofunctors
Abstract. We introduce a generalisation of monads, called relative monads, allowing for underlying functors between different categories. Examples include finite-dimensional vect...
Thorsten Altenkirch, James Chapman, Tarmo Uustalu
FOSSACS
2009
Springer
16 years 12 days ago
Dependency Tree Automata
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...
Colin Stirling