Sciweavers

200 search results - page 27 / 40
» The Intensional Lambda Calculus
Sort
View
LICS
2002
IEEE
14 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
179views Education» more  CORR 2008»
13 years 10 months ago
Induction and Co-induction in Sequent Calculus
Abstract. Proof search has been used to specify a wide range of computation systems. In order to build a framework for reasoning about such specifications, we make use of a sequent...
Alwen Tiu, Alberto Momigliano
ICFP
2003
ACM
14 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
PEPM
2007
ACM
14 years 4 months ago
The semantics of graphical languages
Visual notations are pervasive in circuit design, control systems, and increasingly in mainstream programming environments. Yet many of the foundational advances in programming la...
Stephan Ellner, Walid Taha
FLOPS
2004
Springer
14 years 3 months ago
Semantics of Linear Continuation-Passing in Call-by-Name
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...
Masahito Hasegawa