Sciweavers

Share
TLCA
2005
Springer
9 years 3 months ago
A Lambda Calculus for Quantum Computation with Classical Control
The objective of this paper is to develop a functional programming language for quantum computers. We develop a lambda calculus for the classical control model, following the firs...
Peter Selinger, Benoît Valiron
TLCA
2005
Springer
9 years 3 months ago
Avoiding Equivariance in Alpha-Prolog
αProlog is a logic programming language which is well-suited for rapid prototyping of type systems and operational semantics of typed λ-calculi and many other languages involving...
Christian Urban, James Cheney
TLCA
2005
Springer
9 years 3 months ago
Call-by-Name and Call-by-Value as Token-Passing Interaction Nets
Two common misbeliefs about encodings of the λ-calculus in interaction nets (INs) are that they are good only for strategies that are not very well understood (e.g. optimal reduct...
François-Régis Sinot
TLCA
2005
Springer
9 years 3 months ago
Continuity and Discontinuity in Lambda Calculus
This paper studies continuity of the normal form and the context operators as functions in the infinitary lambda calculus. We consider the Scott topology on the cpo of the finite...
Paula Severi, Fer-Jan de Vries
TLCA
2005
Springer
9 years 3 months ago
Proof Contexts with Late Binding
Abstract. The Focal language (formerly FoC) allows one to incrementally build modules and to formally prove their correctness. In this paper, we present two formal semantics for en...
Virgile Prevosto, Sylvain Boulmé
TLCA
2005
Springer
9 years 3 months ago
L3: A Linear Language with Locations
We explore foundational typing support for strong updates — updating a memory cell to hold values of unrelated types at different points in time. We present a simple, but expres...
Greg Morrisett, Amal J. Ahmed, Matthew Fluet
TLCA
2005
Springer
9 years 3 months ago
Subtyping Recursive Types Modulo Associative Commutative Products
This work sets the formal bases for building tools that help retrieve classes in object-oriented libraries. In such systems, the user provides a query, formulated as a set of class...
Roberto Di Cosmo, François Pottier, Didier ...
TLCA
2005
Springer
9 years 3 months ago
Naming Proofs in Classical Propositional Logic
Abstract. We present a theory of proof denotations in classical propologic. The abstract definition is in terms of a semiring of weights, and two concrete instances are explored. ...
François Lamarche, Lutz Straßburger
books