LFP
1990
14 years 19 days ago
1990
Category theorists invented monads in the 1960's to concisely express certain aspects of universal algebra. Functional programmers invented list comprehensions in the 1970�...
LFP
1990
14 years 19 days ago
1990
d Abstract) V. Breazu-Tannen C. A. Gunter A. Scedrov University of Pennsylvania This paper relates two views of the operational semantics of a language with multiple
LFP
1990
14 years 19 days ago
1990
LFP
1990
14 years 19 days ago
1990
LFP
1990
14 years 19 days ago
1990
Many parallel algorithms are naturally expressed at a ne level of granularity, often ner than a MIMD parallel system can exploit eciently. Most builders of parallel systems have...
LFP
1990
14 years 19 days ago
1990
LFP
1990
14 years 19 days ago
1990
LFP
1990
14 years 19 days ago
1990
This paper presents a module system designed for largescale programming in Scheme. The module system separates speci cations of objects from their implementations, permitting the ...
LFP
1990
14 years 19 days ago
1990
PCF, as considered in this paper, is a lazy typed lambda calculus with functions, pairing, fixed-point operators and arbitrary algebraic data types. The natural equational axioms ...
LFP
1990
14 years 19 days ago
1990
Quest is a programming language based on impredicative type quantifiers and subtyping within a three-level structure of kinds, types and type operators, and values. The semantics ...