Sciweavers

2272 search results - page 43 / 455
» A Calculus for
Sort
View
MSCS
2000
126views more  MSCS 2000»
13 years 8 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
CADE
2006
Springer
14 years 9 months ago
Cut-Simulation in Impredicative Logics
Abstract. We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus ...
Christoph Benzmüller, Chad E. Brown, Michael ...
CADE
2006
Springer
14 years 9 months ago
Automating Proofs in Category Theory
Abstract. We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of cat...
Dexter Kozen, Christoph Kreitz, Eva Richter
ICTAC
2009
Springer
14 years 3 months ago
On the Expressiveness of Forwarding in Higher-Order Communication
Abstract. In higher-order process calculi the values exchanged in communications may contain processes. There are only two capabilities for received processes: execution and forwar...
Cinzia Di Giusto, Jorge A. Pérez, Gianluigi...
TPHOL
2007
IEEE
14 years 2 months ago
Proof Pearl: De Bruijn Terms Really Do Work
Placing our result in a web of related mechanised results, we give a direct proof that the de Bruijn λ-calculus (`a la Huet, Nipkow and Shankar) is isomorphic to an α-quotiented ...
Michael Norrish, René Vestergaard