558 search results - page 25 / 112 » Compiling Resources in a Linear Logic Programming Language |
BANFF
1995
14 years 2 months ago
1995
The automata-theoretic approach to linear temporal logic uses the theory of automata as a unifying paradigm for program specification, verification, and synthesis. Both programs ...
IPPS
1999
IEEE
14 years 3 months ago
1999
IEEE
Marshaling is the process through which structured values are serialized into a stream of bytes; demarshaling converts this stream of bytes back to structured values. Most often, ...
POPL
2010
ACM
14 years 8 months ago
2010
ACM
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
CADE
2005
Springer
14 years 11 months ago
2005
Springer
We present the theory and implementation of a theorem prover for first-order intuitionistic linear logic based on the inverse method. The central proof-theoretic insights underlyin...
LISP
2002
13 years 10 months ago
2002
Security-typed languages enforce secrecy or integrity policies by type-checking. This paper investigates continuation-passing style (CPS) as a means of proving that such languages...