| Publication | Date of Publication | Type |
|---|
The existential fragment of second-order propositional intuitionistic logic is undecidable
Journal of Applied Non-Classical Logics | 2024-03-20 | Paper |
Kripke semantics for intersection formulas
ACM Transactions on Computational Logic | 2022-02-24 | Paper |
| Using inhabitation in bounded combinatory logic with intersection types for composition synthesis | 2021-06-10 | Paper |
Using inhabitation in bounded combinatory logic with intersection types for composition synthesis
(available as arXiv preprint) | 2021-06-10 | Paper |
First-order Answer Set Programming as Constructive Proof Search
Theory and Practice of Logic Programming | 2018-12-04 | Paper |
Answer set programming in intuitionistic logic
Indagationes Mathematicae. New Series | 2018-01-12 | Paper |
How hard is positive quantification?
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
| Restricted positive quantification is not elementary | 2017-07-12 | Paper |
On the Mints hierarchy in first-order intuitionistic logic
Logical Methods in Computer Science | 2017-04-11 | Paper |
Intuitionistic games: determinacy, completeness, and normalization
Studia Logica | 2016-10-27 | Paper |
Type fixpoints, iteration vs. recursion
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming | 2016-09-01 | Paper |
On the Mints hierarchy in first-order intuitionistic logic
Lecture Notes in Computer Science | 2015-10-01 | Paper |
| Bounded combinatory logic | 2012-11-22 | Paper |
The Complexity of Inhabitation with Explicit Intersection
Logic and Program Semantics | 2012-07-16 | Paper |
Finite combinatory logic with intersection types
Lecture Notes in Computer Science | 2011-06-17 | Paper |
The Logic of Persistent Intersection
Fundamenta Informaticae | 2011-05-18 | Paper |
A syntactic embedding of predicate logic into second-order propositional logic
Notre Dame Journal of Formal Logic | 2010-12-01 | Paper |
Positive recursive type assignment
Lecture Notes in Computer Science | 2010-06-17 | Paper |
Inhabitation of Low-Rank Intersection Types
Lecture Notes in Computer Science | 2009-07-07 | Paper |
Strong cut-elimination in sequent calculus using Klop's ι-translation and perpetual reductions
Journal of Symbolic Logic | 2009-03-23 | Paper |
In the Search of a Naive Type Theory
Lecture Notes in Computer Science | 2008-06-03 | Paper |
| Predicates as types | 2008-01-14 | Paper |
Lectures on the Curry-Howard isomorphism
Studies in Logic and the Foundations of Mathematics | 2007-05-30 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2006-01-10 | Paper |
Types for Proofs and Programs
Lecture Notes in Computer Science | 2005-12-23 | Paper |
Computer Science Logic
Lecture Notes in Computer Science | 2005-08-22 | Paper |
| scientific article; zbMATH DE number 2185726 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2087432 (Why is no real title available?) | 2004-08-11 | Paper |
A simple proof of the undecidability of strong normalisation
Mathematical Structures in Computer Science | 2003-06-23 | Paper |
Alpha-conversion and typability
Information and Computation | 2003-01-14 | Paper |
Discrimination by parallel observers: the algorithm.
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1722657 (Why is no real title available?) | 2002-03-21 | Paper |
The subtyping problem for second-order types is undecidable.
Information and Computation | 2002-01-01 | Paper |
| scientific article; zbMATH DE number 1499110 (Why is no real title available?) | 2000-09-03 | Paper |
The emptiness problem for intersection types
Journal of Symbolic Logic | 2000-01-17 | Paper |
Type reconstruction in Fω
Mathematical Structures in Computer Science | 1998-03-24 | Paper |
Comparing cubes of typed and type assignment systems
Annals of Pure and Applied Logic | 1997-10-23 | Paper |
| scientific article; zbMATH DE number 978248 (Why is no real title available?) | 1997-06-03 | Paper |
An analysis of ML typability
Journal of the ACM | 1995-02-13 | Paper |
| scientific article; zbMATH DE number 512796 (Why is no real title available?) | 1994-04-07 | Paper |
| scientific article; zbMATH DE number 445161 (Why is no real title available?) | 1993-12-05 | Paper |
The undecidability of the semi-unification problem
Information and Computation | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 125891 (Why is no real title available?) | 1993-02-21 | Paper |
On the expressive power of finitely typed and universally polymorphic recursive procedures
Theoretical Computer Science | 1992-06-28 | Paper |
| scientific article; zbMATH DE number 4180772 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4104365 (Why is no real title available?) | 1989-01-01 | Paper |
Some relationships between logics of programs and complexity theory
Theoretical Computer Science | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4028877 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4049004 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4024756 (Why is no real title available?) | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4021106 (Why is no real title available?) | 1987-01-01 | Paper |
``During cannot be expressed by ``after
Journal of Computer and System Sciences | 1986-01-01 | Paper |
Necessary and sufficient conditions for the universality of programming formalisms
Acta Informatica | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3880106 (Why is no real title available?) | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3892551 (Why is no real title available?) | 1984-01-01 | Paper |
A necessary and sufficient condition in order that a Herbrand interpretation be expressive relative to recursive programs
Information and Control | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3858392 (Why is no real title available?) | 1983-01-01 | Paper |
Nontrivial definability by flow-chart programs
Information and Control | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3845026 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3789816 (Why is no real title available?) | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3793390 (Why is no real title available?) | 1982-01-01 | Paper |
The unwind property in certain algebras
Information and Control | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3788603 (Why is no real title available?) | 1981-01-01 | Paper |
