Results 1 - 10 of 378

Typeful programming

by Luca Cardelli , 1989
"... There exists an identifiable programming style based on the widespread use of type information handled through mechanical typechecking techniques. This typeful programming style is in a sense independent of the language it is embedded in; it adapts equally well to functional, imperative, object-orie ..."
Abstract - Cited by 151 (2 self) - Add to MetaCart
to languages. We start with an introduction to the notions of types, subtypes and polymorphism. Then we introduce a general framework, derived in part from constructive logic, into which most of the known type systems can be accommodated and extended. The main part of the paper shows how this framework can

Lazy types and Program Analysis

by Chris Hankin, Daniel Le Métayer , 1994
"... Approaches to static analysis based on non-standard type systems have received considerable interest recently. Most work has concentrated on the relationship between such analyses and abstract interpretation. In this paper, we focus on the problem of producing efficient algorithms from such type- ..."
Abstract - Add to MetaCart
-based analyses. The key idea is the notion of lazy types. We present the basic notions in the context of a higher-order strictness analysis of list-processing functions. We also sketch some recent work concerning a general framework for program analysis based on these ideas. We conclude with some experimental

Strictness Analysis of Lazy Functional Programs

by Peter Nicholas Benton , 1992
"... Strictness analysis is a compile-time analysis for lazy functional languages. The information gained by a strictness analyser can be used to improve code generation for both sequential and parallel implementations of such languages. After reviewing the syntax and semantics of a simply typed lambda c ..."
Abstract - Cited by 30 (3 self) - Add to MetaCart
Strictness analysis is a compile-time analysis for lazy functional languages. The information gained by a strictness analyser can be used to improve code generation for both sequential and parallel implementations of such languages. After reviewing the syntax and semantics of a simply typed lambda

Embedding Multiset Constraints into a Lazy Functional Logic Language* P.

by Fac De Cc. Matems
"... Abstract. In recent works, we have proposed a general framework for lazy functional logic programming with algebraic polymorphic types, i.e., parametric datatypes whose data constructors fulfill a given set of equa-tional axioms. The aim of this paper is to investigate implementation techniques for ..."
Abstract - Add to MetaCart
Abstract. In recent works, we have proposed a general framework for lazy functional logic programming with algebraic polymorphic types, i.e., parametric datatypes whose data constructors fulfill a given set of equa-tional axioms. The aim of this paper is to investigate implementation techniques

Once Upon a Polymorphic Type

by Keith Wansbrough, Simon Peyton Jones , 1998
"... We present a sound type-based `usage analysis' for a realistic lazy functional language. Accurate information on the usage of program subexpressions in a lazy functional language permits a compiler to perform a number of useful optimisations. However, existing analyses are either ad-hoc and app ..."
Abstract - Cited by 42 (6 self) - Add to MetaCart
-hoc and approximate, or defined over restricted languages. Our work extends the Once Upon A Type system of Turner, Mossin, and Wadler (FPCA'95). Firstly, we add type polymorphism, an essential feature of typed functional programming languages. Secondly, we include general Haskell-style user-defined algebraic

A Framework for Deterministically Interleaved Interactive Programs in the Functional Programming Language Clean

by Peter Achten, Rinus Plasmeijer , 1994
"... In this paper we present a functional interleaved Event I/O system. This system is a generalization of the Event I/O system as incorporated into the lazy, purely functional programming language Clean. The Inter leaved Event I/O system offers features that are more commonly found outside the functio ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
-order functions and arbitrarily complex algebraic types. Communication by data sharing is a restricted form of communication by global data structures. Nevertheless, the new system is still completely functional because the generalization is done within the pure functional framework. The Interleaved Event I

Lazy Narrowing with Parametric Order Sorted Types

by J.M. Almendros-Jiménez, J. M. Almendros-jim'enez, A. Gil-luezas - Procs. ALP-HOA'97, LNCS 1298 , 1997
"... Recently, a model theoretic semantics for lazy functional programming combining parametric and inclusion polymorphism has been proposed in [2]. The aim of the present work is to provide the previous one with the incorporation of a typed lazy narrowing calculus for goal solving which combines laz ..."
Abstract - Cited by 3 (1 self) - Add to MetaCart
Recently, a model theoretic semantics for lazy functional programming combining parametric and inclusion polymorphism has been proposed in [2]. The aim of the present work is to provide the previous one with the incorporation of a typed lazy narrowing calculus for goal solving which combines

Polymorphic Typed

by François Pottier, Nadji Gauthier
"... Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving transformation of an extension of System F with guarded algebraic data types into itself. We also suggest that defunctionaliz ..."
Abstract - Add to MetaCart
Abstract. Defunctionalization is a program transformation that eliminates functions as first-class values. We show that defunctionalization can be viewed as a type-preserving transformation of an extension of System F with guarded algebraic data types into itself. We also suggest

Type inference with simple subtypes

by John C. Mitchell - J. Funct. Program , 1991
"... Subtyping appears in a variety of programming languages, in the form of the "automatic coercion " of integers to reals, Pascal subranges, and subtypes aris-ing from class hierarchies in languages with inheritance. A general framework based on untyped lambda calculus provides a simple seman ..."
Abstract - Cited by 92 (2 self) - Add to MetaCart
Subtyping appears in a variety of programming languages, in the form of the "automatic coercion " of integers to reals, Pascal subranges, and subtypes aris-ing from class hierarchies in languages with inheritance. A general framework based on untyped lambda calculus provides a simple

Using Powerdomains to Generalize Relational Databases

by Peter Buneman, Achim Jung, Atsushi Ohori - Theoretical Computer Science , 1991
"... Much of relational algebra and the underlying principles of relational database design have a simple representation in the theory of domains that is traditionally used in the denotational semantics of programming languages. By investigating the possible orderings on powerdomains that are well-known ..."
Abstract - Cited by 70 (18 self) - Add to MetaCart
-known in the study of nondeterminism and concurrency it is possible to show that many of the ideas in relational databases apply to structures that are much more general than relations. This also suggests a method of representing database objects as typed objects in programming languages. In this paper we show how
Results 1 - 10 of 378