Sciweavers

5863 search results - page 514 / 1173
» Calculating Functional Programs
Sort
View
MSCS
2008
87views more  MSCS 2008»
15 years 7 months ago
Coercions in a polymorphic type system
The idea of coercive subtyping, a theory of abbreviation for dependent type theories, is incorporated into the polymorphic type system in functional programming languages. The tra...
Zhaohui Luo
174
Voted
ENTCS
2000
83views more  ENTCS 2000»
15 years 7 months ago
Typed Logical Variables in Haskell
We describe how to embed a simple typed functional logic programming language in Haskell. The embedding is a natural extension of the Prolog embedding by Seres and Spivey [16]. To...
Koen Claessen, Peter Ljunglöf
208
Voted
SMI
2008
IEEE
116views Image Analysis» more  SMI 2008»
16 years 2 months ago
Self-organizing primitives for automated shape composition
Motivated by the ability of living cells to form into specific shapes and structures, we present a new approach to shape modeling based on self-organizing primitives whose behavi...
Linge Bai, Manolya Eyiyurekli, David E. Breen
202
Voted
POPL
1998
ACM
15 years 12 months ago
Higher-Order unCurrying
We present a formal specification of unCurrying for a higher-order, functional language with ML-style let-polymorphism. This specification supports the general unCurrying of func...
John Hannan, Patrick Hicks
CLEIEJ
2002
113views more  CLEIEJ 2002»
15 years 7 months ago
The MT Stack: Paging Algorithm and Performance in a Distributed Virtual Memory System
Advances in parallel computation are of central importance to Artificial Intelligence due to the significant amount of time and space their programs require. Functional languages ...
Marco T. Morazán, Douglas R. Troeger, Myles...