249 search results - page 13 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
TPHOL
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract. How close are we to a world where every paper on programming languages is accompanied by an electronic appendix with machinechecked proofs? We propose an initial set of b...
POPL
2004
ACM
14 years 9 months ago
2004
ACM
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
TAPSOFT
1997
Springer
14 years 22 days ago
1997
Springer
The SML-like module systems are small typed languages of their own. As is, one would expect a proof of their soundness following from a proof of subject reduction. Unfortunately, t...
APLAS
2009
ACM
14 years 18 days ago
2009
ACM
Type and effect systems are a tool to analyse statically the behaviour of programs with effects. We present a proof based on the so called reducibility candidates that a suitable ...
LREC
2010
13 years 10 months ago
2010
This paper shows that a LAF/GrAF-based annotation schema can be used for the adequate representation of syntactic dependency structures in many languages. We first argue that ther...