Sciweavers

1320 search results - page 58 / 264
» Efficient Implementation of a Linear Logic Programming Langu...
Sort
View
FP
1992
135views Formal Methods» more  FP 1992»
15 years 7 months ago
High Level Specification of I/O in Functional Languages
The interface with the outside world has always been one of the weakest points of functional languages. It is not easy to incorporate I/O without being allowed to do side-effects....
Peter Achten, John H. G. van Groningen, Marinus J....
POPL
2009
ACM
16 years 3 months ago
Automatic modular abstractions for linear constraints
c Modular Abstractions for Linear Constraints David Monniaux VERIMAG June 27, 2008 se a method for automatically generating abstract transformers for static by abstract interpreta...
David Monniaux
C++
1994
128views more  C++ 1994»
15 years 4 months ago
Implementing Signatures for C++
ne the design and detail the implementation of a language extension for abstracting types and for decoupling subtyping and inheritance in C++. This extension gives the user more of...
Gerald Baumgartner, Vincent F. Russo
EUROCOLT
1999
Springer
15 years 7 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
ICFP
2009
ACM
16 years 3 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