1185 search results - page 111 / 237 » Implementing Functional Languages: a tutorial |
APL
1992
ACM
15 years 2 months ago
1992
ACM
We present the design and implementation of APL Intrinsic Functions for a Finite State Machine (also known as a Finite State Automaton) which recognizes regular languages, and a P...
IFL
2004
Springer
15 years 3 months ago
2004
Springer
Landin’s SECD machine was the first abstract machine for the λ-calculus viewed as a programming language. Both theoretically as a model of computation and practically as an ide...
APLAS
2009
ACM
15 years 4 months ago
2009
ACM
We propose a method for easily developing efficient programs for finding optimal sequences, such as the maximum weighted sequence of a set of feasible ones. We formalize a way to ...
MPC
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. Datatypes which differ inessentially in their names and structure are said to be isomorphic; for example, a ternary product is isomorphic to a nested pair of binary prod...
101
click to vote
MPC
2010
Springer
15 years 2 months ago
2010
Springer
Parser combinators are a popular tool for designing parsers in functional programming languages. If such combinators generate an abstract representation of the grammar as an interm...