Sciweavers

239 search results - page 27 / 48
» The Safe Lambda Calculus
Sort
View
PPDP
2005
Springer
15 years 3 months ago
A new calculus of contexts
We study contexts (terms with holes) by proposing a ‘λcalculus with holes’. It is very expressive and can encode programming constructs apparently unrelated to contexts, incl...
Murdoch Gabbay
84
Voted
CONCUR
2006
Springer
15 years 1 months ago
Dynamic Access Control in a Concurrent Object Calculus
Abstract. We develop a variant of Gordon and Hankin's concurrent object calculus with support for flexible access control on methods. We investigate safe administration and ac...
Avik Chaudhuri
LICS
2002
IEEE
15 years 2 months ago
Remarks on Isomorphisms in Typed Lambda Calculi with Empty and Sum Types
Tarski asked whether the arithmetic identities taught in high school are complete for showing all arithmetic equations valid for the natural numbers. The answer to this question f...
Marcelo P. Fiore, Roberto Di Cosmo, Vincent Balat
CORR
2008
Springer
122views Education» more  CORR 2008»
14 years 9 months ago
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
Abstract We investigate here a new version of the Calculus of Inductive Constructions (CIC) on which the proof assistant Coq is based: the Calculus of Congruent Inductive Construct...
Frédéric Blanqui, Jean-Pierre Jouann...
ICFP
2003
ACM
15 years 9 months ago
Mechanising Hankin and Barendregt using the Gordon-Melham axioms
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
Michael Norrish