1194 search results - page 88 / 239 » A Calculus for Predicative Programming |
142
click to vote
FOAL
2007
ACM
15 years 10 months ago
2007
ACM
By modeling dynamic join points, pointcuts, and advice in a defunctionalized continuation-passing style interpreter, we provide a fundamental account of these AOP mechanisms. Dyna...
163
click to vote
TLCA
1993
Springer
15 years 10 months ago
1993
Springer
This paper describes formalizations of Tait’s normalization proof for the simply typed λ-calculus in the proof assistants Minlog, Coq and Isabelle/HOL. From the formal proofs p...
157
click to vote
ESOP
2001
Springer
15 years 10 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...
145
click to vote
ICFP
1996
ACM
15 years 10 months ago
1996
ACM
An extension of the simply-typed lambda calculus is presented which contains both well-structured inductive and coinductive types, and which also identifies a class of types for w...
191
click to vote
TAPSOFT
1997
Springer
15 years 10 months ago
1997
Springer
We present a typed intermediate language λCIL for optimizing compilers for function-oriented and polymorphically typed programming languages (e.g., ML). The language λCIL is a ty...