Michael J. O'Donnell

Available identifiers

Publication	Date of Publication	Type
Infinite terms and infinite rewritings	2023-03-09	Paper
Testing confluence of nonterminating rewriting systems	2023-03-09	Paper
Intuitive counterexamples for constructive fallacies	2022-08-18	Paper
Connecting formal semantics to constructive intuitions	2017-11-17	Paper
Some intuitions behind realizability semantics for constructive logic: Tableaux and Läuchli countermodels	1998-03-12	Paper
How to prove representation-independent independence results	1987-01-01	Paper
Collections of Functions for Perfect Hashing	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3776590	1985-01-01	Paper
Implementation of an interpreter for abstract equations	1985-01-01	Paper
Lower Bounds for Sorting with Realistic Instruction Sets	1985-01-01	Paper
The Expressiveness of Simple and Second-Order Type Structures	1983-01-01	Paper
Pattern Matching in Trees	1982-01-01	Paper
A critique of the foundations of Hoare style programming logics	1982-01-01	Paper
Programming with Equations	1982-01-01	Paper
Geometric Problems with Application to Hashing	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3964008	1982-01-01	Paper
A Combinatorial Problem Concerning Processor Interconnection Networks	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3875311	1978-01-01	Paper
Computing in systems described by equations	1977-01-01	Paper

This page was built for person: Michael J. O'Donnell