Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- ArticleSeptember 1998
Recycling continuations
ICFP '98: Proceedings of the third ACM SIGPLAN international conference on Functional programmingPages 251–260https://doi.org/10.1145/289423.289452If the continuations in functional data-structure-generating programs are made explicit and represented as records, they can be "recycled." Once they have served their purpose as temporary, intermediate structures for managing program control, the space ...
Also Published in:
ACM SIGPLAN Notices: Volume 34 Issue 1 - ArticleSeptember 1998
Cayenne—a language with dependent types
ICFP '98: Proceedings of the third ACM SIGPLAN international conference on Functional programmingPages 239–250https://doi.org/10.1145/289423.289451Cayenne is a Haskell-like language. The main difference between Haskell and Cayenne is that Cayenne has dependent types, i.e., the result type of a function may depend on the argument value, and types of record components (which can be types or values) ...
Also Published in:
ACM SIGPLAN Notices: Volume 34 Issue 1 - ArticleSeptember 1998
Lava: hardware design in Haskell
ICFP '98: Proceedings of the third ACM SIGPLAN international conference on Functional programmingPages 174–184https://doi.org/10.1145/289423.289440Lava is a tool to assist circuit designers in specifying, designing, verifying and implementing hardware. It is a collection of Haskell modules. The system design exploits functional programming language features, such as monads and type classes, to ...
Also Published in:
ACM SIGPLAN Notices: Volume 34 Issue 1