Sciweavers

291 search results - page 4 / 59
» A Logic for Parametric Polymorphism
Sort
View
TLCA
2009
Springer
15 years 4 months ago
Syntax for Free: Representing Syntax with Binding Using Parametricity
We show that, in a parametric model of polymorphism, the type ∀α.((α → α) → α) → (α → α → α) → α is isomorphic to closed n terms. That is, the type of closed ...
Robert Atkey
57
Voted
IOLTS
2008
IEEE
91views Hardware» more  IOLTS 2008»
15 years 3 months ago
Physical Demonstration of Polymorphic Self-Checking Circuits
Polymorphic gates can be considered as a new reconfigurable technology capable of integrating logic functions with sensing in a single compact structure. Polymorphic gates whose ...
Richard Ruzicka, Lukás Sekanina, Roman Prok...
FPCA
1989
15 years 1 months ago
Theorems for Free!
Parametric polymorphism constrains the behavior of pure functional programs in a way that allows the derivation of interesting theorems about them solely from their types, i.e., v...
Philip Wadler
82
Voted
TPHOL
2007
IEEE
15 years 3 months ago
Proof Pearl: The Power of Higher-Order Encodings in the Logical Framework LF
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
Brigitte Pientka
ESOP
2010
Springer
15 years 6 months ago
Testing Polymorphic Properties
Abstract. This paper is concerned with testing properties of polymorphic functions. The problem is that testing can only be performed on specific monomorphic instances, whereas par...
Jean-Philippe Bernardy, Patrik Jansson and Koen Cl...