6 results
First-order Answer Set Programming as Constructive Proof Search
-
- Journal:
- Theory and Practice of Logic Programming / Volume 18 / Issue 3-4 / July 2018
- Published online by Cambridge University Press:
- 10 August 2018, pp. 673-690
-
- Article
-
- You have access
- Export citation
17 - Advanced Properties and Applications
- from Part III - Intersection Types λS∩
-
-
- Book:
- Lambda Calculus with Types
- Published online:
- 05 August 2013
- Print publication:
- 20 June 2013, pp 728-790
-
- Chapter
- Export citation
Strong cut-elimination in sequent calculus using Klop's ι-translation and perpetual reductions
-
- Journal:
- The Journal of Symbolic Logic / Volume 73 / Issue 3 / September 2008
- Published online by Cambridge University Press:
- 12 March 2014, pp. 919-932
- Print publication:
- September 2008
-
- Article
- Export citation
A simple proof of the undecidability of strong normalisation
-
- Journal:
- Mathematical Structures in Computer Science / Volume 13 / Issue 1 / February 2003
- Published online by Cambridge University Press:
- 04 March 2003, pp. 5-13
-
- Article
- Export citation
The emptiness problem for intersection types
-
- Journal:
- The Journal of Symbolic Logic / Volume 64 / Issue 3 / September 1999
- Published online by Cambridge University Press:
- 12 March 2014, pp. 1195-1215
- Print publication:
- September 1999
-
- Article
- Export citation
Type reconstruction in Fω
-
- Journal:
- Mathematical Structures in Computer Science / Volume 7 / Issue 4 / August 1997
- Published online by Cambridge University Press:
- 01 August 1997, pp. 329-358
-
- Article
- Export citation