171 search results - page 15 / 35 » CoSP: a general framework for computational soundness proofs |
TLCA
2005
Springer
15 years 5 months ago
2005
Springer
Cut elimination is a central result of the proof theory. This paper proposes a new approach for proving the theorem for Gentzen’s intuitionistic sequent calculus LJ, that relies ...
77
Voted
SIGCSE
1997
ACM
15 years 3 months ago
1997
ACM
When teaching a course in compiler design, it is conventional to introduce the iterative calculation of least fixed points quite late in the course, in the guise of iterative dat...
101
Voted
FOSSACS
2003
Springer
15 years 4 months ago
2003
Springer
We develop a system of type assignment with intersection types, union types, indexed types, and universal and existential dependent types that is sound in a call-by-value functiona...
107
click to vote
FOAL
2009
ACM
15 years 6 months ago
2009
ACM
We present a programming language model of the ideas behind Functional Adaptive Programming (AP-F) and our Java implementation, DemeterF. Computation in AP-F is encapsulated in se...
SP
2010
IEEE
15 years 3 months ago
2010
IEEE
—A growing number of current web sites combine active content (applications) from untrusted sources, as in so-called mashups. The object-capability model provides an appealing ap...