FLOPS
14 years 3 months ago
2004 Springer 
We propose a semantic framework for modelling the linear usage of continuations in typed call-by-name programming languages. On the semantic side, we introduce a construction for c...
FLOPS
14 years 1 months ago
2004 Springer 
Abstract. This paper describes how high level implementations of (needed) narrowing into Prolog can be improved by analysing definitional trees. First, we introduce a refined repre...
FLOPS
14 years 3 months ago
2004 Springer 
Abstract. This article is a brief and subjective survey of quantum programming language research. 1 Quantum Computation Quantum computing is a relatively young subject. It has its ...
FLOPS
14 years 3 months ago
2004 Springer 
This paper presents a complete (infinite) axiomatization for an algebraic construction of graphs, in which a finite fragment denotes the class of graphs with bounded tree width.
FLOPS
14 years 3 months ago
2004 Springer 
We present a method for automatic program inversion of functional programs based on methods of LR parsing. We formalize the transformation and illustrate it with the inversion of a...
|
Automated Reasoning