Get started
Author

F. Lockwood Morris

Observed names: F. L. Morris, F.L. Morris, F.Lockwood Morris
Institution: Syracuse University
Observed institution: Syracuse University
OpenAlex ID: A5086814530
Advice on structuring compilers and proving them correct
1973 · F. Lockwood Morris · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · 136
PDF
An Early Program Proof by Alan Turing
1984 · F.L. Morris, C.B. Jones · IEEE Annals of the History of Computing · 94
A time- and space-efficient garbage compaction algorithm
1978 · F. Lockwood Morris · Communications of the ACM · 65
PDF
A generalization of the trie data structure
1995 · Richard H. Connelly, F. Lockwood Morris · Mathematical Structures in Computer Science · 28
Playing disjunctive sums is polynomial space complete
1981 · F. L. Morris · International Journal of Game Theory · 18
Correctness of Translations of Programming Languages -- An Algebraic Approach
1972 · F. L. Morris · Defense Technical Information Center (DTIC) · 12
Prohibiting repetitions makes playing games substantially harder
1984 · A. Pultr, F. L. Morris · International Journal of Game Theory · 7
On List Structures and Their Use in the Programming of Unification
1978 · F. Lockwood Morris · Syracuse University Libraries (Syracuse University) · 6
Computing cyclic list structures
1980 · F. Lockwood Morris, Jerald S. Schwarz · ACM Conference on LISP and Functional Programming (LFP) · 4
Another compacting garbage collector
1982 · F. Lockwood Morris · Information Processing Letters · 2
Domains for logic programming
1992 · I. Filippenko, F.L. Morris · Theoretical Computer Science · 1
A few exercises in theorem processing
2007 · F. Lockwood Morris · Theoretical Computer Science
PDF
A Non-Deterministric Parallel Sorting Algorithm
1992 · Xue Shirley Li, F. Lockwood Morris · Syracuse University Libraries (Syracuse University)
PDF
Letter to the editor
1983 · F.Lockwood Morris · Information Processing Letters
Works count: 15
Citation count: 373
H-index: 7
I10-index: 6
Year
Topic
Type