Journal of functional and logic programming · 2001 · 42 citations · 15 references
ComputingComputer ScienceLogicProgramming LanguagesTheory Of ComputationFunctional ProgrammingLogic ProgrammingType CheckingType SystemsHigher-order LogicHigher-order Logic ProgrammingPolymorphic Type SystemsPolymorphic TypesPolymorphism StudiesType Systems For Logic Programming
The rewriting logic CRWL has been proposed as a semantic frame- work for higher-order functional logic programming, using applicative rewriting systems as programs and lazy narrowing as the goal solving procedure. We present an extension of CRWL with a polymorphic type system, and we investigate the consequences of type discipline both at the semantic level and at the operational level. Semanti- cally, models must be extended to incorporate a type universe. Oper- ationally, lazy narrowing must maintain suitable type information in goals, in order to guarantee well-typed computed answers. ∗This research has been partially supported by the Spanish National Project TIC98- 0445-C03-02 “TREND” and the Esprit BRA Working Group EP-22457 “CCLII”. A pre- liminary version of the paper, much shorter and including no proofs, was published as [20].
15
A theory of type polymorphism in programming
Robin Milner · Journal of Computer and System Sciences · 1978 · 2.2K citations · Full text
Principal type-schemes for functional programs
Robin Milner · 1982 · 1.1K citations
Report on the programming language Haskell
Paul Hudak, Simon Peyton Jones, Philip Wadler et al. · ACM SIGPLAN Notices · 1992 · 1K citations · Full text
Jan Willem Klop · Data Archiving and Networked Services (DANS) · 1990 · 783 citations
Proving termination with multiset orderings
Nachum Dershowitz, Zohar Manna · Communications of the ACM · 1979 · 540 citations · Full text