Sciweavers

558 search results - page 4 / 112
» Compiling Resources in a Linear Logic Programming Language
Sort
View
ICFP
2008
ACM
14 years 7 months ago
A type-preserving compiler in Haskell
There has been a lot of interest of late for programming languages that incorporate features from dependent type systems and proof assistants in order to capture in the types impo...
Louis-Julien Guillemette, Stefan Monnier
PPCP
1993
13 years 11 months ago
Higher-Order Logic Programming as Constraint Logic Programming
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
Spiro Michaylov, Frank Pfenning
CADE
2008
Springer
14 years 7 months ago
Celf - A Logical Framework for Deductive and Concurrent Systems (System Description)
CLF (Concurrent LF) [CPWW02a] is a logical framework for specifying and implementing deductive and concurrent systems from areas, such as programming language theory, security prot...
Anders Schack-Nielsen, Carsten Schürmann
POPL
2006
ACM
14 years 7 months ago
Formal certification of a compiler back-end or: programming a compiler with a proof assistant
This paper reports on the development and formal certification (proof of semantic preservation) of a compiler from Cminor (a Clike imperative language) to PowerPC assembly code, u...
Xavier Leroy
ENTCS
2000
109views more  ENTCS 2000»
13 years 7 months ago
Forward and Backward Chaining in Linear Logic
Abstract. Logic programming languages based on linear logic are of both theoretical and practical interest, particulaly because such languages can be seen as providing a logical ba...
James Harland, David J. Pym, Michael Winikoff