Jones, Mark P. (1995). Gofer. Available via ftp on ftp.cs.nott.ac.uk. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Polytypic Unification - Jansson, Jeuring (1993) (1 citation) (Correct)
....dependence in the datatype dependent part we obtain a polytypic program. Thus we have one implementation of unification that works for many different term types leaving the specialisation to the computer. The core of the unification algorithm is written in Haskell (using the Gofer interpreter (Jones, 1995)) and the polytypic part in PolyP (Jansson Jeuring, 1997) The full code is available from http: www.cs.chalmers.se patrikj unify . 2 Unification 2.1 Terms In the unification literature, a term is usually defined as either a variable or an application of a constructor to zero or more terms. ....
Jones, Mark P. (1995). Gofer. Available via ftp on ftp.cs.nott.ac.uk.
Polytypic Programming - Jeuring, Jansson (1996) (51 citations) (Correct)
No context found.
Mark P. Jones. Gofer. Available via ftp on ftp.cs.nott.ac.uk, 1995.
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