133
Voted
FLOPS
15 years 4 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...
119
Voted
FLOPS
15 years 5 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 ...
88
Voted
FLOPS
15 years 5 months ago
2004 Springer
We propose pattern matching calculi as a refinement of λ-calculus that integrates mechanisms appropriate for fine-grained modelling of non-strict pattern matching. Compared with...
97
Voted
FLOPS
15 years 5 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...
115
Voted
FLOPS
15 years 5 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...
|
Automated Reasoning