A Functional Programming Approach to Hypermedia Authoring
No abstract available.
1,066 papers · page 50 of 54
Type Errors Confuse the Programmer (Poster Abstract)
No abstract available.
On the Runtime Complexity of Type-Directed Unboxing
Avoiding boxing when representing native objects is essential for the efficient compilation of any programming language For polymorphic languages this task is difficult, but several schemes have been proposed that remove boxing on the basis of type information. Leroy's type-direc…
A Distributed Garbage Collector with Diffusion Tree Reorganisation and Mobile Objects
We present a new distributed garbage collection algorithm that is able to reorganise diffusion trees and to support mobile objects. It has a modular design comprising three components: a reliable transport mechanism, a reference-counting based distributed garbage collector for no…
The Spineless Tagless G-machine, naturally
The application of natural semantic specifications of lazy evaluation to areas such as usage analysis, formal profiling and abstract machine construction has shown it to be a useful formalism. This paper introduces several variants and extensions of this specification.The first v…
Pragmatic Subtyping in Polymorphic Languages
We present a subtyping extension to the Hindley/Milner type system that is based on name inequivalence. This approach allows the subtype relation to be defined by incremental construction of polymorphic records and datatypes, in a way that subsumes the basic type systems of both …
Programming with Variable Functions
What is a good method to specify and derive imperative programs? This paper argues that a new form of functional programming fits the bill, where variable functions can be updated at specified points in their domain. Traditional algebraic specification and functional programming …
A Framework for Type Inference with Subtyping
This paper appeared at the International Conference on Functional Programming, Baltimore, September 1998.
On Application of Self-Similar Pictures in Education
MAP: A Functional Analysis and Design Method
No abstract available.
Imperative Streams - A Monadic Combinator Library for Synchronous Programming
The paper presents a generalization of Haskell's IO monad suitable for synchronous concurrent programming. The new monad integrates the deterministic concurrency paradigm of synchronous programming with the powerful abstraction features of functional languages and with full suppo…
Typed Cross-Module Compilation
Higher-order modules are very effective in structuring large programs and defining generic, reusable software components. Unfortunately, many compilation techniques for the core languages do not work across the module boundaries. As a result, few optimizing compilers support thes…
Implementing Typed Intermediate Languages
Recent advances in compiler technology have demonstrated the benefits of using strongly typed intermediate languages to compile richly typed source languages (e.g., ML). A typepreserving compiler can use types to guide advanced optimizations and to help generate provably secure m…
Recycling Continuations
If 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 they occupy can be reused …
A Theory of Core Fudgets
The Fudgets system is a toolkit for developing graphical applications in the lazy functional programming language Haskell. In this paper we develop an operational semantics for a subset of this system, inspired by ideas from concurrency theory. A semantic theory based on bisimula…
Building Program Optimizers with Rewriting Strategies
We describe a language for defining term rewriting strategies, and its application to the production of program optimizers. Valid transformations on program terms can be described by a set of rewrite rules; rewriting strategies are used to describe when and how the various rules …
The Marriage of Effects and Monads
Gifford and others proposed an effect typing discipline to delimit the scope of computational effects within a program, while Moggi and others proposed monads for much the same purpose. Here we marry effects to monads, uniting two previously separate lines of research. In particu…
Encoding Types in ML-Like Languages
A Hindley-Milner type system such as ML's seems to prohibit type-indexed values, i.e., functions that map a family of types to a family of values. Such functions generally perform case analysis on the input types and return values of possibly different types. The goal of our work…
Automating Derivation of Incremental Programs
No abstract available.
A GUI on Top of a Functional Language
status: Published