Sciweavers

89 search results - page 17 / 18
» Abstract Syntax and Variable Binding
Sort
View
ICLP
1998
Springer
15 years 10 months ago
Compiling Resources in a Linear Logic Programming Language
There have been several proposals for logic programming language based on linear logic: Lolli [6], Lygon [5], LO [3], LinLog [2], Forum [8]. In addition, BinProlog allows the use ...
Mutsunori Banbara, Naoyuki Tamura
PODC
1990
ACM
15 years 9 months ago
Half-Order Modal Logic: How to Prove Real-Time Properties
Abstract. We introduce a novel extension of propositional modal logic that is interpreted over Kripke structures in which a value is associated with every possible world. These val...
Thomas A. Henzinger
ITP
2010
114views Mathematics» more  ITP 2010»
15 years 9 months ago
A New Foundation for Nominal Isabelle
Pitts et al introduced a beautiful theory about names and binding based on the notions of permutation and support. The engineering challenge is to smoothly adapt this theory to a t...
Brian Huffman, Christian Urban
POPL
2010
ACM
16 years 3 months ago
A Verified Compiler for an Impure Functional Language
We present a verified compiler to an idealized assembly language from a small, untyped functional language with mutable references and exceptions. The compiler is programmed in th...
Adam J. Chlipala
176
Voted
GPCE
2004
Springer
15 years 11 months ago
Taming Macros
Scheme includes a simple yet powerful macro mechanism. Using macros, programmers can easily extend the language with new kinds of expressions and definitions, thus abstracting ove...
Ryan Culpepper, Matthias Felleisen