91 search results - page 9 / 19 » A Simple Semantics for Polymorphic Recursion |
118
Voted
FSTTCS
1999
Springer
15 years 3 months ago
1999
Springer
We present a (the rst?) sound and relatively complete Hoare logic for a simple imperative programming language including mutually recursive procedures with call-by-value parameters...
ICFP
1999
ACM
15 years 3 months ago
1999
ACM
We propose a conservative extension of the polymorphic lambda calculus (A5B ) as an intermediate language for compiling languages with name-based class and interface hierarchies. ...
100
click to vote
TCS
2011
14 years 6 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
102
click to vote
LICS
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
100
click to vote
LICS
2008
IEEE
15 years 6 months ago
2008
IEEE
Collapsible pushdown automata (CPDA) are a new kind of higher-order pushdown automata in which every symbol in the stack has a link to a stack situated somewhere below it. In addi...