Michael J. O'Donnell

33 papers A* 3B 3Journal 18Unranked 7

Year	Rank	Type	Title / Venue / Authors
2008	B	`conf`	Problems Encountered When Implementing Agile Methods in a Very Small Company. EuroSPI Michael J. O'Donnell, Ita Richardson
2005	J	`jnl`	Separate handles from names on the internet. Commun. ACM Michael J. O'Donnell
2003	J	`jnl`	A Proposal to Separate Handles from Names on the Internet CoRR Michael J. O'Donnell
2003	J	`jnl`	Open Network Handles Implemented in DNS CoRR Michael J. O'Donnell
2001	J	`jnl`	Leveled Garbage Collection. J. Funct. Log. Program. Guanshan Tong, Michael J. O'Donnell
2001	J	`jnl`	Source-Filter Decomposition of Harmonic Sounds CoRR Ilia Bisnovatyi, Michael J. O'Donnell
2000	J	`jnl`	The Sound Manifesto CoRR Michael J. O'Donnell, Ilia Bisnovatyi
1999	J	`jnl`	The Sources of Certainty in Computation and Formal Systems CoRR Michael J. O'Donnell
1996	J	`jnl`	Some Intuitions Behind Realizability Semantics for Constructive Logic: Tableaux and Läuchli Countermodels. Ann. Pure Appl. Log. James Lipton, Michael J. O'Donnell
1994	B	`conf`	Intuitive Counterexamples for Constructive Fallacies. MFCS James Lipton, Michael J. O'Donnell
1992	—	`ed.`	Constructivity in Computer Science, Summer Symposium, San Antonio, Texas, USA, June 19-22, Proceedings Constructivity in Computer Science J. Paul Myers Jr., Michael J. O'Donnell
1991	—	`conf`	Connecting Formal Semantics to Constructive Intuitions. Constructivity in Computer Science Stuart A. Kurtz, John C. Mitchell, Michael J. O'Donnell
1990	—	`conf`	Infinite Terms and Infinite Rewritings. CTRS Yiyun Chen, Michael J. O'Donnell
1990	—	`conf`	Testing Confluence of Nonterminating Rewriting Systems. CTRS Yiyun Chen, Michael J. O'Donnell
1987	J	`jnl`	How to Prove Representation-Independent Independence Results. Inf. Process. Lett. Stuart A. Kurtz, Michael J. O'Donnell, James S. Royer
1987	—	`conf`	Term-Rewriting Implementation of Equational Logic Programming. RTA Michael J. O'Donnell
1986	J	`jnl`	Collections of Functions for Perfect Hashing. SIAM J. Comput. Francine Berman, Mary Ellen Bock, Eric Dittert, Michael J. O'Donnell, Darrell Plank
1986	—	`conf`	Exact Real Arithmetic: A Case Study in Higher Order Programming. LISP and Functional Programming Hans-Juergen Boehm, Robert Cartwright, Mark Riggle, Michael J. O'Donnell
1986	B	`conf`	Realisability Semantics for Error-Tolerant Logics. TARK John C. Mitchell, Michael J. O'Donnell
1985	—	`conf`	Equational Logic as a Programming Language. Logic of Programs Michael J. O'Donnell
1985	J	`jnl`	Implementation of an Interpreter for Abstract Equations. Softw. Pract. Exp. Christoph M. Hoffmann, Michael J. O'Donnell, Robert Strandh
1985	J	`jnl`	Lower Bounds for Sorting with Realistic Instruction Sets. IEEE Trans. Computers Eric Dittert, Michael J. O'Donnell
1984	A*	`conf`	Implementation of an Interpreter for Abstract Equations. POPL Christoph M. Hoffmann, Michael J. O'Donnell
1983	J	`jnl`	The Expressiveness of Simple and Second-Order Type Structures J. ACM Steven Fortune, Daniel Leivant, Michael J. O'Donnell
1982	J	`jnl`	A Combinatorial Problem Concerning Processor Interconnection Networks. IEEE Trans. Computers Michael J. O'Donnell, Carl H. Smith
1982	J	`jnl`	A Critique of the Foundations of Hoare Style Programming Logics. Commun. ACM Michael J. O'Donnell
1982	J	`jnl`	Geometric Problems with Application to Hashing. SIAM J. Comput. Douglas Comer, Michael J. O'Donnell
1982	J	`jnl`	Pattern Matching in Trees. J. ACM Christoph M. Hoffmann, Michael J. O'Donnell
1982	J	`jnl`	Programming with Equations. ACM Trans. Program. Lang. Syst. Christoph M. Hoffmann, Michael J. O'Donnell
1981	—	`conf`	A Critique of the Foundations of Hoare-Style Programming Logics. Logic of Programs Michael J. O'Donnell
1979	A*	`conf`	A Programming Language Theorem Which Is Independent of Peano Arithmetic STOC Michael J. O'Donnell
1979	A*	`conf`	Interpreter Generation Using Tree Pattern Matching. POPL Christoph M. Hoffmann, Michael J. O'Donnell
1977	—	`book`	Computing in Systems Described by Equations Michael J. O'Donnell