30 search results - page 1 / 6 » On Constructor Rewrite Systems and the Lambda-Calculus |
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
TCS
2008
13 years 4 months ago
2008
Intersection types are well-known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type...
PPDP
2005
Springer
13 years 10 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...
FPCA
1989
13 years 8 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
CONCUR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. We present a reconstruction of session types in a conventional pi calculus where types are qualified as linear or unrestricted. Linearly typed communication channels are ...