|
352
|
ML for the Working Programmer
– L C Paulson
- 1996
|
|
315
|
How to Make Ad-Hoc Polymorphism Less Ad Hoc
– Philip Wadler, Stephen Blott
- 1988
|
|
874
|
A theory of type polymorphism in programming
– Robin Milner
- 1978
|
|
171
|
A System of Constructor Classes: Overloading and Implicit Higher-Order Polymorphism
– Mark P. Jones
- 1995
|
|
32
|
Proof Terms for Simply Typed Higher Order Logic
– Stefan Berghofer, Tobias Nipkow
- 2000
|
|
585
|
Isabelle/HOL: A Proof Assistant for Higher-Order Logic
– T Nipkow, L C Paulson, M Wenzel
- 2002
|
|
111
|
Type classes in Haskell
– Cordelia Hall, Kevin Hammond, Simon Peyton Jones, Philip Wadler
- 1996
|
|
125
|
Qualified types: theory and practice
– M P Jones
- 1992
|
|
81
|
Type inference with constrained types. Theory and Practice of Object Systems
– M Odersky, M Sulzmann, M Wehr
- 1999
|
|
136
|
de Bruijn. Lambda calculus notation with nameless dummies, a tool for automatic formula manipulation, with application to the Church-Rosser Theorem
– N G
- 1972
|
|
58
|
Type Classes and Overloading in Higher-Order Logic
– Markus Wenzel, Technische Universität München
- 1997
|
|
57
|
Functional unification of higher-order patterns
– T Nipkow
- 1993
|
|
90
|
Seventy-five problems for testing automatic theorem provers
– F J Pelletier
- 1986
|
|
173
|
Isabelle: The next 700 theorem provers
– L C Paulson
- 1990
|
|
9
|
ML for the Working Programmer. Cambridge University Press, 2nd edition
– L C Paulson
- 1996
|
|
1497
|
The Definition of Standard ML
– Robin Milner, Mads Tofte, Robert Harper
- 1990
|
|
29
|
A General Framework for Hindley/Milner Type Systems with Constraints
– Martin Sulzmann
- 2000
|
|
40
|
A Second Look at Overloading
– Martin Odersky, Philip Wadler, Martin Wehr
- 1995
|
|
387
|
The Foundation of a Generic Theorem Prover
– Lawrence C. Paulson
- 1989
|
