| Publication | Date of Publication | Type |
|---|
Efficient reassembling of three-regular planar graphs
Journal of Combinatorial Optimization | 2020-04-27 | Paper |
Personal Reflections on the Role of Mathematical Logic in Computer Science
Fundamenta Informaticae | 2020-01-24 | Paper |
Efficient reassembling of graphs. I: The linear case
Journal of Combinatorial Optimization | 2017-06-22 | Paper |
Safe compositional network sketches: formal framework
Proceedings of the 13th ACM international conference on Hybrid systems: computation and control | 2017-05-10 | Paper |
A user-friendly interface for a lightweight verification system
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
Implementing compositional analysis using intersection types with expansion variables
Electronic Notes in Theoretical Computer Science | 2013-08-16 | Paper |
The Complexity of Restricted Variants of the Stable Paths Problem
Fundamenta Informaticae | 2011-05-18 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Principality and type inference for intersection types using expansion variables
Theoretical Computer Science | 2004-10-27 | Paper |
scientific article; zbMATH DE number 1988960 (Why is no real title available?)
| 2003-10-20 | Paper |
Orderly communication in the ambient calculus.
Computer Languages, Systems & Structures | 2003-05-04 | Paper |
Alpha-conversion and typability
Information and Computation | 2003-01-14 | Paper |
scientific article; zbMATH DE number 1692941 (Why is no real title available?)
| 2002-01-21 | Paper |
A linearization of the Lambda-calculus and consequences
Journal Of Logic And Computation | 2000-09-04 | Paper |
scientific article; zbMATH DE number 1302672 (Why is no real title available?)
| 1999-06-16 | Paper |
An analysis of ML typability
Journal of the ACM | 1995-02-13 | Paper |
scientific article; zbMATH DE number 193636 (Why is no real title available?)
| 1993-06-05 | Paper |
The undecidability of the semi-unification problem
Information and Computation | 1993-05-16 | Paper |
scientific article; zbMATH DE number 139621 (Why is no real title available?)
| 1993-03-28 | Paper |
scientific article; zbMATH DE number 125891 (Why is no real title available?)
| 1993-02-21 | Paper |
Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus
Information and Computation | 1992-09-27 | 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 |
A linear-time algorithm to decide whether a binary word contains an overlap
RAIRO - Theoretical Informatics and Applications | 1988-01-01 | Paper |
scientific article; zbMATH DE number 4024756 (Why is no real title available?)
| 1987-01-01 | Paper |
Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)
Information and Control | 1985-01-01 | Paper |
Necessary and sufficient conditions for the universality of programming formalisms
Acta Informatica | 1985-01-01 | Paper |
The unwind property for programs with bounded memory
Information Processing Letters | 1985-01-01 | Paper |
scientific article; zbMATH DE number 3892551 (Why is no real title available?)
| 1984-01-01 | Paper |
Definability by programs in first-order structures
Theoretical Computer Science | 1983-01-01 | Paper |
scientific article; zbMATH DE number 3784268 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3755841 (Why is no real title available?)
| 1982-01-01 | Paper |
scientific article; zbMATH DE number 3738889 (Why is no real title available?)
| 1981-01-01 | Paper |
On the termination of program schemas
Information and Control | 1975-01-01 | Paper |
Translatability of schemas over restricted interpretations
Journal of Computer and System Sciences | 1974-01-01 | Paper |
