Sciweavers

64 search results - page 1 / 13
» On the Implementation of Construction Functions for Non-free...
Sort
View
ESOP
2007
Springer
13 years 11 months ago
On the Implementation of Construction Functions for Non-free Concrete Data Types
Abstract. Many algorithms use concrete data types with some additional invariants. The set of values satisfying the invariants is often a set of representatives for the equivalence...
Frédéric Blanqui, Thérè...
LISP
2006
91views more  LISP 2006»
13 years 4 months ago
Polymorphic typed defunctionalization and concretization
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving trans...
François Pottier, Nadji Gauthier
CORR
2011
Springer
198views Education» more  CORR 2011»
12 years 12 months ago
Concrete Sentence Spaces for Compositional Distributional Models of Meaning
Coecke, Sadrzadeh, and Clark [3] developed a compositional model of meaning for distributional semantics, in which each word in a sentence has a meaning vector and the distributio...
Edward Grefenstette, Mehrnoosh Sadrzadeh, Stephen ...
TYPES
1994
Springer
13 years 9 months ago
A Concrete Final Coalgebra Theorem for ZF Set Theory
A special final coalgebra theorem, in the style of Aczel's [2], is proved within standard Zermelo-Fraenkel set theory. Aczel's AntiFoundation Axiom is replaced by a varia...
Lawrence C. Paulson
PLDI
2011
ACM
12 years 7 months ago
Data representation synthesis
We consider the problem of specifying combinations of data structures with complex sharing in a manner that is both declarative lts in provably correct code. In our approach, abst...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...