397 search results - page 11 / 80 » The lambda calculus is algebraic |
FROCOS
2005
Springer
15 years 3 months ago
2005
Springer
Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with f...
POPL
1999
ACM
15 years 1 months ago
1999
ACM
Notions of program dependency arise in many settings: security, partial evaluation, program slicing, and call-tracking. We argue that there is a central notion of dependency commo...
ENTCS
2006
14 years 9 months ago
2006
We present a proof technique in -calculus that can facilitate inductive reasoning on -terms by separating certain -developments from other -reductions. We give proofs based on thi...
LPAR
2010
Springer
14 years 7 months ago
2010
Springer
We present an explicitly typed lambda calculus "`a la Church" based on the union and intersection types discipline; this system is the counterpart of the standard type a...
84
Voted
ESOP
2001
Springer
15 years 1 months ago
2001
Springer
Abstract. Languages for intensional type analysis permit ad-hoc polymorphism, or run-time analysis of types. However, such languages require complex, specialized constructs to supp...