| Publication | Date of Publication | Type |
|---|
In memoriam Paris C. Kanellakis
ACM Computing Surveys | 2019-08-09 | Paper |
An analysis of the Core-ML language: Expressive power and type reconstruction
Automata, Languages and Programming | 2019-04-29 | Paper |
On global dynamics of optimal graph reduction
Proceedings of the second ACM SIGPLAN international conference on Functional programming | 2017-08-21 | Paper |
Optimality and inefficiency: what isn't a cost model of the lambda calculus?
Proceedings of the first ACM SIGPLAN international conference on Functional programming - ICFP '96 | 2016-09-01 | Paper |
Functional geometry and the \textit{Traité de lutherie} (functional pearl)
Proceedings of the 18th ACM SIGPLAN international conference on Functional programming | 2015-03-30 | Paper |
Deciding \(k\)CFA is complete for EXPTIME
Proceedings of the 13th ACM SIGPLAN international conference on Functional programming | 2015-03-16 | Paper |
Types, potency, and idempotency: why nonlinearity and amnesia make a type system work
Proceedings of the ninth ACM SIGPLAN international conference on Functional programming | 2015-03-09 | Paper |
Relating complexity and precision in control flow analysis
Proceedings of the 12th ACM SIGPLAN international conference on Functional programming | 2014-07-21 | Paper |
On the computational complexity of cut-elimination in linear logic.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Flow Analysis, Linearity, and PTIME
Static Analysis | 2008-08-28 | Paper |
Robert Paige (1947--1999)
Higher-Order and Symbolic Computation | 2006-02-08 | Paper |
FUNCTIONAL PEARL Linear lambda calculus and PTIME-completeness
Journal of Functional Programming | 2005-03-21 | Paper |
| scientific article; zbMATH DE number 1954368 (Why is no real title available?) | 2003-07-28 | Paper |
| scientific article; zbMATH DE number 1948160 (Why is no real title available?) | 2003-07-10 | Paper |
Parallel beta reduction is not elementary recursive
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1538029 (Why is no real title available?) | 2000-12-03 | Paper |
Undecidable boundedness problems for datalog programs
The Journal of Logic Programming | 1997-04-17 | Paper |
Database query languages embedded in the typed lambda calculus
Information and Computation | 1996-10-01 | Paper |
IN MEMORIAM Paris C. Kanellakis (1953–1995)
Journal of Algorithms | 1996-06-04 | Paper |
The complexity of type inference for higher-order typed lambda calculi
Journal of Functional Programming | 1995-12-13 | Paper |
Quantifier elimination and parametric polymorphism in programming languages
Journal of Functional Programming | 1995-05-01 | Paper |
Generating words in a context-free language uniformly at random
Information Processing Letters | 1994-04-04 | Paper |
Undecidable optimization problems for database logic programs
Journal of the ACM | 1993-12-06 | Paper |
The effect of table expansion on the program complexity of perfect hash functions
BIT | 1993-01-16 | Paper |
A simple proof of a theorem of Statman
Theoretical Computer Science | 1993-01-16 | Paper |
Some new upper bounds on the generation of prime numbers
Communications of the ACM | 1977-01-01 | Paper |
