174 search results - page 21 / 35 » Efficient Intensional Implementation for Lazy Functional Lan... |
POPL
1995
ACM
13 years 11 months ago
1995
ACM
We show how a set of building blocks can be used to construct programming language interpreters, and present implementations of such building blocks capable of supporting many com...
ENTCS
2008
13 years 7 months ago
2008
Most implementations of functional and functional logic languages treat numbers and the basic numeric operations as external entities. The main reason for this is efficiency. Howe...
DAC
2006
ACM
14 years 8 months ago
2006
ACM
or Abstraction for the Functional Verification of FPGAs Guy Dupenloup, Thierry Lemeunier, Roland Mayr Altera Corporation 101 Innovation Drive San Jose, CA 95134 1-408-544-8672 {gdu...
FOIKS
2006
Springer
13 years 11 months ago
2006
Springer
It is claimed in [45] that first-order theorem provers are not efficient for reasoning with ontologies based on description logics compared to specialised description logic reasone...
ICFP
2005
ACM
14 years 7 months ago
2005
ACM
A limited form of dependent types, called Generalized Algebraic Data Types (GADTs), has recently been added to the list of Haskell extensions supported by the Glasgow Haskell Comp...