F. Lockwood Morris

According to our database, F. Lockwood Morris authored at least 11 papers between 1972 and 2007.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of four.

2007

A few exercises in theorem processing.

F. Lockwood Morris

Theor. Comput. Sci., 2007

1995

A Generalization of the Trie Data Structure.

Richard H. Connelly, F. Lockwood Morris

Math. Struct. Comput. Sci., 1995

1993

The Next 700 Formal Language Descriptions.

F. Lockwood Morris

LISP Symb. Comput., 1993

1992

Domains for Logic Programming.

Ivan Filippenko, F. Lockwood Morris

Theor. Comput. Sci., 1992

1984

An Early Program Proof by Alan Turing.

F. Lockwood Morris, Cliff B. Jones

IEEE Ann. Hist. Comput., 1984

1982

Another Compacting Garbage Collector.

F. Lockwood Morris

Inf. Process. Lett., 1982

1980

Computing Cyclic List Structures.

F. Lockwood Morris, J. Schwarz

Proceedings of the 1980 LISP Conference, Stanford, California, USA, August 25-27, 1980., 1980

1978

A Time- and Space-Efficient Garbage Compaction Algorithm.

F. Lockwood Morris

Commun. ACM, 1978

A Metalanguage for Interactive Proof in LCF.

Michael J. C. Gordon, Robin Milner, F. Lockwood Morris, Malcolm C. Newey, Christopher P. Wadsworth

Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

1973

Advice on Structuring Compilers and Proving Them Correct.

F. Lockwood Morris

Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

1972

Correctness of translations of programming languages: an algebraic approach.

F. Lockwood Morris

PhD thesis, 1972