249 search results - page 10 / 50 » Principals in Programming Languages: A Syntactic Proof Techn... |
ICFP
2000
ACM
14 years 29 days ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
POPL
1993
ACM
14 years 20 days ago
1993
ACM
We study the type inference problem for a system with type classes as in the functional programminglanguage Haskell. Type classes are an extension of ML-style polymorphismwith ove...
PPDP
2007
Springer
14 years 2 months ago
2007
Springer
We describe a semantic type soundness result, formalized in the Coq proof assistant, for a compiler from a simple imperative language with heap-allocated data into an idealized as...
WCRE
2002
IEEE
14 years 1 months ago
2002
IEEE
In this paper we describe a technique that can be used to annotate source code with syntactic tags in XML format. This is achieved by modifying the parser generator bison to emit ...
ICFP
2010
ACM
13 years 9 months ago
2010
ACM
We present a technique for higher-order representation of substructural logics such as linear or modal logic. We show that such logics can be encoded in the (ordinary) Logical Fra...