Sciweavers

Share
ICFP
2012
ACM
6 years 11 months ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler
TOCL
2012
235views Formal Methods» more  TOCL 2012»
6 years 11 months ago
Topological and Simplicial Models of Identity Types
racting these leads us to introduce the notion of a path object category. This is a relatively simple axiomatic framework, which is nonetheless sufficiently strong to allow the con...
Benno van den Berg, Richard Garner
LICS
2012
IEEE
6 years 11 months ago
Step Indexed Realizability Semantics for a Call-by-Value Language Based on Basic Combinatorial Objects
—We propose a mathematical framework for step indexed realizability semantics of a call-by-value polymorphic lambda calculus with recursion, existential types and recursive types...
Naohiko Hoshino
LOGCOM
2010
158views more  LOGCOM 2010»
8 years 7 months ago
Applying Universal Algebra to Lambda Calculus
The aim of this paper is double. From one side we survey the knowledge we have acquired these last ten years about the lattice of all λ-theories (= equational extensions of untype...
Giulio Manzonetto, Antonino Salibra
MSCS
2000
126views more  MSCS 2000»
8 years 9 months ago
Sequent combinators: a Hilbert system for the lambda calculus
This paper introduces a Hilbert system for lambda calculus called sequent combinators. Sequent combinators address many of the problems of Hilbert systems, which have led to the m...
Healfdene Goguen, Jean Goubault-Larrecq
CORR
2008
Springer
172views Education» more  CORR 2008»
8 years 9 months ago
Lecture notes on the lambda calculus
This is a set of lecture notes that developed out of courses on the lambda calculus that I taught at the University of Ottawa in 2001 and at Dalhousie University in 2007. Topics c...
Peter Selinger
APLAS
2001
ACM
9 years 1 months ago
Linearly Used Effects: Monadic and CPS Transformations into the Linear Lambda Calculus
Abstract. We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as th...
Masahito Hasegawa
ASIAN
2006
Springer
140views Algorithms» more  ASIAN 2006»
9 years 1 months ago
On Completeness of Logical Relations for Monadic Types
Interesting properties of programs can be expressed using contextual equivalence. The latter is difficult to prove directly, hence (pre-)logical relations are often used as a tool ...
Slawomir Lasota, David Nowak, Yu Zhang
RTA
2010
Springer
9 years 1 months ago
Simulation in the Call-by-Need Lambda-Calculus with letrec
This paper shows the equivalence of applicative similarity and contextual approximation, and hence also of bisimilarity and contextual equivalence, in the deterministic call-by-nee...
Manfred Schmidt-Schauß, David Sabel, Elena M...
PEPM
1997
ACM
9 years 1 months ago
A Type-directed, On-line, Partial Evaluator for a Polymorphic Language
Recently, Olivier Danvy introduced a new, simple method for implementing powerful partial evaluators, namely typedirected partial evaluation 9 . He introduced a partial evaluator ...
Tim Sheard
books