Assaf Kfoury

Available identifiers

zbMath Open kfoury.assaf-jMaRDI QIDQ801664

List of research outcomes

Publication	Date of Publication	Type
Efficient reassembling of three-regular planar graphs	2020-04-27	Paper
Personal Reflections on the Role of Mathematical Logic in Computer Science	2020-01-24	Paper
Efficient reassembling of graphs. I: The linear case	2017-06-22	Paper
Safe compositional network sketches	2017-05-10	Paper
A User-friendly Interface for a Lightweight Verification System	2014-07-22	Paper
Implementing compositional analysis using intersection types with expansion variables	2013-08-16	Paper
The Complexity of Restricted Variants of the Stable Paths Problem	2011-05-18	Paper
Programming Languages and Systems	2007-09-28	Paper
Principality and type inference for intersection types using expansion variables	2004-10-27	Paper
https://portal.mardi4nfdi.de/entity/Q4430287	2003-10-20	Paper
Orderly communication in the ambient calculus.	2003-05-04	Paper
Alpha-conversion and typability	2003-01-14	Paper
https://portal.mardi4nfdi.de/entity/Q2763674	2002-01-21	Paper
A linearization of the Lambda-calculus and consequences	2000-09-04	Paper
https://portal.mardi4nfdi.de/entity/Q4249224	1999-06-16	Paper
An analysis of ML typability	1995-02-13	Paper
https://portal.mardi4nfdi.de/entity/Q4040439	1993-06-05	Paper
The undecidability of the semi-unification problem	1993-05-16	Paper
https://portal.mardi4nfdi.de/entity/Q4029600	1993-03-28	Paper
https://portal.mardi4nfdi.de/entity/Q4027630	1993-02-21	Paper
Type reconstruction in finite rank fragments of the second-order \(\lambda\)-calculus	1992-09-27	Paper
On the expressive power of finitely typed and universally polymorphic recursive procedures	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3204025	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3829053	1989-01-01	Paper
A linear-time algorithm to decide whether a binary word contains an overlap	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3766818	1987-01-01	Paper
Definability by deterministic and non-deterministic programs (with applications to first-order dynamic logic)	1985-01-01	Paper
Necessary and sufficient conditions for the universality of programming formalisms	1985-01-01	Paper
The unwind property for programs with bounded memory	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5184368	1984-01-01	Paper
Definability by programs in first-order structures	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3962469	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3939207	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3925141	1981-01-01	Paper
On the termination of program schemas	1975-01-01	Paper
Translatability of schemas over restricted interpretations	1974-01-01	Paper

Research outcomes over time

This page was built for person: Assaf Kfoury