Verbose Typing
No abstract available.
1,066 papers · page 49 of 54
Implementing Design Patterns as Language Constructs
No abstract available.
A Term Calculus for Unitary Approach to Nomalization
No abstract available.
Modular Object-Oriented Programming with Units and Mixins
Module and class systems have evolved to meet the demand for reuseable software components. Considerable effort has been invested in developing new module and class systems, and in demonstrating how each promotes code reuse. However, relatively little has been said about the inte…
H/Direct: A Binary Foreign Language Interface for Haskell
H/Direct is a foreign-language interface for the purely functional language Haskell. Rather than rely on host-language type signatures, H/Direct compiles Interface Definition Language (IDL) to Haskell stub code that marshals data across the interface. This approach allows Haskell…
The Under-Appreciated Unfold
Folds are appreciated by functional programmers; the benefits of encapsulating common patterns of computation as higher-order operators are well-known and well understood. Their dual, unfolds, are nearly as well-known, but not nearly as well appreciated. We believe they deserve b…
A Type Based Sharing Analysis for Update Avoidance and Optimisation
Sharing of evaluation is crucial for the efficiency of lazy functional languages, but unfortunately the machinery to implement it carries an inherent overhead. In abstract machines this overhead shows up as the cost of performing updates, many of them actually unnecessary, and al…
Combining CFG and Recursive Functions to Get a New Language
No abstract available.
Higher-Order Arity Raising
Arity raising, also known as variable splitting or flattening, is the program optimization which transforms a function of one argument into a function of several arguments by decomposing the structure of the original one argument into individual components in that structure. This…
PLAN: A Packet Language for Active Networks
PLAN (Packet Language for Active Networks) is a new language for programs that form the packets of a programmable network. These programs replace the packet headers (which can be viewed as very rudimentary programs) used in current networks. As such, PLAN programs are lightweight…
Fold and Unfold for Program Semantics
In this paper we explain how recursion operators can be used to structure and reason about program semantics within a functional language. In particular, we show how the recursion operator fold can be used to structure denotational semantics, how the dual recursion operator unfol…
Functional Differentiation of Computer Programs
We present two purely functional implementations of the computational differentiation tools -- the well known numeric (not symbolic!) techniques which permit to compute pointwise derivatives of functions defined by computer programs economically and exactly. We show how the co-re…
Taming Effects with Monadic Typing
The familiar Hindley-Milner type system of the ML language family is extended with monad annotations to account for possible side effects of expression evaluation. This also allows effects to be effectively encapsulated by lexical scopes Γ with enforcement provided by type checki…
LAND*: an AND with local bindings, a guarded LET* special form
No abstract available.
Functional Style in C++: Closures, Late Binding, and Lambda Abstractions
A Delegation Language to Request Weather Products and a Scheme of Its Interpretation
No abstract available.
A Lazy CGI Namespace in Scheme
No abstract available.
A Non-Deterministic Call-by-Need Lambda Calculus
In this paper we present a non-deterministic call-by-need (untyped) lambda calculus X,d with a constant choice and a let-syntax that models sharing. Our main result is that Xnd has the nice operational properties of the standard lambda calculus: confluence on sets of expressions,…
Frob - Functional Robotics
No abstract available.
YALE: Yet Another Lambda Evaluator Based on Interaction Nets
Interaction nets provide a graphical paradigm of computation based on net rewriting. They have proved most successful in understanding the dynamics of reduction in the λ-calculus, where the prime example is the implementation of optimal reduction for the λ-calculus (Lamping's alg…