Sciweavers

194 search results - page 9 / 39
» An Introduction to the Lambda Calculus
Sort
View
TOCL
2012
235views Formal Methods» more  TOCL 2012»
11 years 10 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
TLCA
2007
Springer
14 years 1 months ago
Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calcu...
Denis Cousineau 0002, Gilles Dowek
FCT
2005
Springer
14 years 1 months ago
A Self-dependency Constraint in the Simply Typed Lambda Calculus
We consider terms of simply typed lambda calculus in which copy of a subterm may not be inserted to the argument of itself during the reduction. The terms form wide class which inc...
Aleksy Schubert
FROCOS
2005
Springer
14 years 1 months ago
A Concurrent Lambda Calculus with Futures
Reasoning about the correctness of program transformations requires a notion of program equivalence. We present an observational semantics for the concurrent lambda calculus with f...
Joachim Niehren, Jan Schwinghammer, Gert Smolka
LOGCOM
2010
158views more  LOGCOM 2010»
13 years 6 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