Implementing Ruby in a Higher-Order Logic Programming Language (1995)

Cached

Download Links

by Richard McPhee
Citations:2 - 0 self

Documents Related by Co-Citation

2 Concerning formulas of the types A!BC, A!(Ex)B(x) in intuitionistic formal systems – R Harrop - 1960
2 The proper treatement of quantification in ordinary English – R Montague - 1974
2 Implementing Theorem – A Felty - 1987
16 Higher-order Unification with Dependent Function Types – Conal M. Elliott - 1989
32 A Semi-Functional Implementation of a Higher-Order Logic Programming Language – Conal Elliott, Frank Pfenning - 1991
31 A higher-order logic as the basis for logic programming – G Nadathur - 1987
43 Specifying and Implementing Theorem Provers in a Higher-Order Logic Programming Language – Amy Felty - 1989
61 Implementing Tactics and Tacticals in a Higher-Order Logic Programming Language – Amy Felty - 1993
62 Lexical scoping as universal quantification – Dale Miller - 1989
23 A denotational semantics for Prolog – T Nicholson, N Foo - 1989
36 A Theory of Modules for Logic Programming – Dale Miller - 1986
84 A Multiple-Conclusion Meta-Logic – Dale Miller - 1994
52 Unification of simply typed lambda-terms as logic programming – Dale Miller - 1991
131 A polymorphic type system for Prolog – A Mycroft, R O’Keefe - 1984
55 Typed Prolog: A semantic reconstruction of the Mycroft-O’Keefe type system – T K Lakshman, U S Reddy - 1991
136 A logical analysis of modules in logic programming. The – Dale Miller - 1989
1739 Foundations of Logic Programming – J W Lloyd - 1984
335 Uniform proofs as a foundation for logic programming – Dale Miller, Gopalan Nadathur , Frank Pfenning , Andre Scedrov - 1991
395 The formulae-as-types notion of construction – W A Howard - 1980