| L.C.Paulson: Constructing recursion operators in intuitionistic type theory, University of Cambridge, Computer Laboratory, Technical Report No. 57, 1984. |
....Moreover, computer systems require possibly divergent programs for routine functioning, hence total programming languages cannot cover interesting aspects Page 23 of programming. The retrofitting of recursion into type theory is being actively pursued [Backhouse 84, Constable 83, Constable 84, Paulson 84] and these problems may be solved in the future. If our position is instead to admit divergent computations from the start, then the proposition as type paradigm can be recast as a powerful type system (no longer a logic) which is not incompatible with the Type:Type property. Although this ....
L.C.Paulson: Constructing recursion operators in intuitionistic type theory, University of Cambridge, Computer Laboratory, Technical Report No. 57, 1984.
....matching, which is the special case of higher order unification in which one of the terms involved does not contain free variables. Two readily available systems incorporating higher order unification are Prolog [20] an extension of Prolog to typed terms, and the generic theorem prover Isabelle [22]. Since we had some experience with schemes for translating first order algebraic specifications to Prolog (see the surveys by Drosten [7] and Bouma and Walters [4] we chose Prolog as our target system. It would be nice if the notion of initial algebra specification, which has unequivocal ....
L.C. Paulson and T. Nipkow, Isabelle tutorial and user's manual, Technical Report No. 189, Computer Laboratory, University of Cambridge, January 1990.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC