Sciweavers

558 search results - page 6 / 112
» Compiling Resources in a Linear Logic Programming Language
Sort
View
POPL
2002
ACM
14 years 7 months ago
Proving correctness of compiler optimizations by temporal logic
Many classical compiler optimizations can be elegantly expressed using rewrite rules of form: I = I if , where I, I are intermediate language instructions and is a property expre...
David Lacey, Neil D. Jones, Eric Van Wyk, Carl Chr...
ICFP
2009
ACM
14 years 8 months ago
Biorthogonality, step-indexing and compiler correctness
We define logical relations between the denotational semantics of a simply typed functional language with recursion and the operational behaviour of low-level programs in a varian...
Nick Benton, Chung-Kil Hur
ICAI
2010
13 years 5 months ago
A Programming Environment for Bousi-Prolog
BousiProlog is a fuzzy logic programming language which is an extension of the standard Prolog language. The BousiProlog operational semantics is an adaptation of the SLD resoluti...
Pascual Julián Iranzo, Clemente Rubio-Manza...
POPL
2012
ACM
12 years 3 months ago
Higher-order functional reactive programming in bounded space
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
Neelakantan R. Krishnaswami, Nick Benton, Jan Hoff...
VMCAI
2012
Springer
12 years 3 months ago
Teaching Semantics with a Proof Assistant: No More LSD Trip Proofs
We describe a course on the semantics of a simple imperative programming language and on applications to compilers, type systems, static analyses and Hoare logic. The course is ent...
Tobias Nipkow