Results 1 
3 of
3
Theorems for free!
 FUNCTIONAL PROGRAMMING LANGUAGES AND COMPUTER ARCHITECTURE
, 1989
"... From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the same theorem. This provides a free source of useful theorems, courtesy of Reynolds' abstraction theorem for the polymorphic lambda calculus. ..."
Abstract

Cited by 339 (6 self)
 Add to MetaCart
From the type of a polymorphic function we can derive a theorem that it satisfies. Every function of the same type satisfies the same theorem. This provides a free source of useful theorems, courtesy of Reynolds' abstraction theorem for the polymorphic lambda calculus.
A SetTheoretic Model for a Typed Polymorphic Lambda Calculus  A Contribution to MetaSoft
 Proceedings VDM'88 Symposium, Lecture Notes in Computer Science 328
, 1988
"... this paper is to define precisely the settheoretic interpretation of the MLlike polymorphic system of types. The aim of this Introduction is to convince the Reader that this is worthwhile to try. ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
this paper is to define precisely the settheoretic interpretation of the MLlike polymorphic system of types. The aim of this Introduction is to convince the Reader that this is worthwhile to try.