Sciweavers

79 search results - page 4 / 16
» Intersection Types and Lambda Theories
Sort
View
152
Voted
CORR
2010
Springer
158views Education» more  CORR 2010»
15 years 5 months ago
A Minimal Propositional Type Theory
Propositional type theory, first studied by Henkin, is the restriction of simple type theory to a single base type that is interpreted as the set of the two truth values. We show ...
Mark Kaminski, Gert Smolka
MSCS
2000
126views more  MSCS 2000»
15 years 5 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
ICFP
2006
ACM
16 years 5 months ago
Static typing for a faulty lambda calculus
A transient hardware fault occurs when an energetic particle strikes a transistor, causing it to change state. These faults do not cause permanent damage, but may result in incorr...
David Walker, Lester W. Mackey, Jay Ligatti, Georg...
PLDI
2009
ACM
16 years 3 days ago
Typed self-representation
Self-representation – the ability to represent programs in their own language – has important applications in reflective languages and many other domains of programming langu...
Tillmann Rendel, Klaus Ostermann, Christian Hofer
CADE
2000
Springer
15 years 9 months ago
Automated Proof Construction in Type Theory Using Resolution
We provide techniques to integrate resolution logic with equality in type theory. The results may be rendered as follows. − A clausification procedure in type theory, equipped w...
Marc Bezem, Dimitri Hendriks, Hans de Nivelle