| Publication | Date of Publication | Type |
|---|
| scientific article; zbMATH DE number 7453191 (Why is no real title available?) | 2022-01-06 | Paper |
scientific article; zbMATH DE number 7453191 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-06 | Paper |
| A Swiss pocket knife for computability | 2021-06-21 | Paper |
A Swiss pocket knife for computability
(available as arXiv preprint) | 2021-06-21 | Paper |
| Programming in biomolecular computation: programs, self-interpretation and visualisation | 2019-02-08 | Paper |
Proving the correctness of unfold/fold program transformations using bisimulation
Perspectives of Systems Informatics | 2015-12-07 | Paper |
Asymptotic speedups, bisimulation and distillation (work in progress)
Lecture Notes in Computer Science | 2015-12-03 | Paper |
A flow calculus of \(mwp\)-bounds for complexity analysis
ACM Transactions on Computational Logic | 2015-09-17 | Paper |
Programs=data=first-class citizens in a computational world
Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences | 2015-08-21 | Paper |
Constant time factors do matter
Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
The size-change principle for program termination
Proceedings of the 28th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Proving correctness of compiler optimizations by temporal logic
Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages | 2015-03-17 | Paper |
Programming in biomolecular computation
Electronic Notes in Theoretical Computer Science | 2014-03-21 | Paper |
Fifty years of the spectrum problem: survey and new results
The Bulletin of Symbolic Logic | 2013-01-17 | Paper |
Fifty years of the spectrum problem: survey and new results
The Bulletin of Symbolic Logic | 2013-01-17 | Paper |
Size-change termination and transition invariants
Static Analysis | 2010-10-01 | Paper |
Rewriting Techniques and Applications
Lecture Notes in Computer Science | 2009-04-30 | Paper |
Call-by-value Termination in the Untyped lambda-calculus
Logical Methods in Computer Science | 2008-08-07 | Paper |
Linear, Polynomial or Exponential? Complexity Inference in Polynomial Time
Logic and Theory of Algorithms | 2008-06-19 | Paper |
| Selected topics on computability, complexity, and termination | 2008-01-14 | Paper |
Programming Languages and Systems
Lecture Notes in Computer Science | 2006-10-20 | Paper |
| scientific article; zbMATH DE number 5033861 (Why is no real title available?) | 2006-06-19 | Paper |
New Computational Paradigms
Lecture Notes in Computer Science | 2006-01-11 | Paper |
Compiler optimization correctness by temporal logic
Higher-Order and Symbolic Computation | 2005-03-15 | Paper |
Transformation by interpreter specialisation
Science of Computer Programming | 2004-11-22 | Paper |
| scientific article; zbMATH DE number 2110614 (Why is no real title available?) | 2004-10-26 | Paper |
| scientific article; zbMATH DE number 2018578 (Why is no real title available?) | 2003-12-16 | Paper |
| scientific article; zbMATH DE number 1765657 (Why is no real title available?) | 2002-07-10 | Paper |
| scientific article; zbMATH DE number 1761898 (Why is no real title available?) | 2002-07-01 | Paper |
| scientific article; zbMATH DE number 1738287 (Why is no real title available?) | 2002-05-06 | Paper |
The expressive power of higher-order types or, life without CONS
Journal of Functional Programming | 2002-04-09 | Paper |
| scientific article; zbMATH DE number 1522991 (Why is no real title available?) | 2001-10-30 | Paper |
Computational complexity via programming languages: Constant factors do matter
Acta Informatica | 2000-12-07 | Paper |
LOGSPACE and PTIME characterized by programming languages
Theoretical Computer Science | 2000-08-23 | Paper |
| scientific article; zbMATH DE number 1405577 (Why is no real title available?) | 2000-03-27 | Paper |
A partial evaluator for the untyped lambda-calculus
Journal of Functional Programming | 2000-02-09 | Paper |
| scientific article; zbMATH DE number 1339873 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1339956 (Why is no real title available?) | 1999-09-22 | Paper |
| scientific article; zbMATH DE number 1332637 (Why is no real title available?) | 1999-09-08 | Paper |
| scientific article; zbMATH DE number 1231465 (Why is no real title available?) | 1998-12-10 | Paper |
A positive supercompiler
Journal of Functional Programming | 1997-06-04 | Paper |
| scientific article; zbMATH DE number 236855 (Why is no real title available?) | 1993-07-15 | Paper |
| scientific article; zbMATH DE number 177846 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 65747 (Why is no real title available?) | 1992-09-27 | Paper |
Static semantics, types, and binding time analysis
Theoretical Computer Science | 1992-06-26 | Paper |
| scientific article; zbMATH DE number 4101166 (Why is no real title available?) | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4050967 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3938547 (Why is no real title available?) | 1986-01-01 | Paper |
A method for detecting structure in polyhedra
Pattern Recognition Letters | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3808933 (Why is no real title available?) | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3735091 (Why is no real title available?) | 1981-01-01 | Paper |
| scientific article; zbMATH DE number 3755850 (Why is no real title available?) | 1981-01-01 | Paper |
A Note on the Complexity of General $D0L$ Membership
SIAM Journal on Computing | 1981-01-01 | Paper |
Complexity of some problems concerningL systems
Mathematical Systems Theory | 1979-01-01 | Paper |
The Complexity of Finite Memory Programs with Recursion
Journal of the ACM | 1978-01-01 | Paper |
Parsers for indexed grammars
International Journal of Computer & Information Sciences | 1978-01-01 | Paper |
TEMPO: A unified treatment of binding time and parameter passing concepts in programming languages
Lecture Notes in Computer Science | 1978-01-01 | Paper |
Corrigendum: Context free languages and rudimentary attributes
Mathematical Systems Theory | 1978-01-01 | Paper |
Complete problems for deterministic polynomial time
Theoretical Computer Science | 1977-01-01 | Paper |
Even Simple Programs Are Hard To Analyze
Journal of the ACM | 1977-01-01 | Paper |
Complexity of some problems in Petri nets
Theoretical Computer Science | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3566199 (Why is no real title available?) | 1977-01-01 | Paper |
Recognition of deterministic ETOL languages in logarithmic space
Information and Control | 1977-01-01 | Paper |
Corrigendum: Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences | 1977-01-01 | Paper |
A note on linear time simulation of deterministic two-way pushdown automata
Information Processing Letters | 1977-01-01 | Paper |
New problems complete for nondeterministic log space
Mathematical Systems Theory | 1976-01-01 | Paper |
Space-bounded reducibility among combinatorial problems
Journal of Computer and System Sciences | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3562483 (Why is no real title available?) | 1975-01-01 | Paper |
Turing machines and the spectra of first-order formulas
Journal of Symbolic Logic | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3586493 (Why is no real title available?) | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3455240 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3591972 (Why is no real title available?) | 1972-01-01 | Paper |
A note on the index of a context-free language
Information and Control | 1970-01-01 | Paper |
Context-free languages and rudimentary attributes
Mathematical Systems Theory | 1969-01-01 | Paper |
Classes of automata and transitive closure
Information and Control | 1968-01-01 | Paper |
