397 search results - page 66 / 80 » The lambda calculus is algebraic |
APLAS
2007
ACM
15 years 1 months ago
2007
ACM
We have built the first family of tagless interpretations for a higher-order typed object language in a typed metalanguage (Haskell or ML) that require no dependent types, general...
103
click to vote
LOGCOM
2007
14 years 9 months ago
2007
We provide algebraic semantics together with a sound and complete sequent calculus for information update due to epistemic actions. This semantics is flexible enough to accommoda...
ICFP
2007
ACM
15 years 9 months ago
2007
ACM
We analyze the computational complexity of kCFA, a hierarchy of control flow analyses that determine which functions may be applied at a given call-site. This hierarchy specifies ...
ICFP
2005
ACM
15 years 9 months ago
2005
ACM
This paper defines PolyAML, a typed functional, aspect-oriented programming language. The main contribution of PolyAML is the seamless integration of polymorphism, run-time type a...
PPDP
2009
Springer
15 years 4 months ago
2009
Springer
Hybrid is a system developed to specify and reason about logics, programming languages, and other formal systems expressed in rder abstract syntax (HOAS). An important goal of Hyb...