495 search results - page 20 / 99 » Extensible Proof-Producing Compilation |
APIN
2000
13 years 7 months ago
2000
Defeasible logic is a system of reasoning in which rules have exceptions, and when rules conflict, the one that applies most specifically to the situation wins out. This paper repo...
SFP
2003
13 years 9 months ago
2003
: Static single information form is a natural extension of the well-known static single assignment form. It is a program intermediate representation used in optimising compilers fo...
ENTCS
2000
13 years 7 months ago
2000
We develop, in a stepwise fashion, a set of parser combinators for constructing deterministic, error-correcting parsers. The only restriction on the grammar is that it is not left...
CADE
2002
Springer
14 years 7 months ago
2002
Springer
This paper reports on the formal proof of correctness of a compiler from a substantial subset of Java source language to Java bytecode in the proof environment Isabelle. This work ...
SAC
2005
ACM
14 years 1 months ago
2005
ACM
During language evolution, compiler construction is usually d along two dimensions: defining new abstract syntax tree (AST) classes, or adding new operations. In order to facilita...