CiteSeerX — Design of the Programming Language Forsythe

Design of the Programming Language Forsythe (1996) [90 citations — 0 self]

Popular Tags

No tags have been applied to this document.

BibTeX | Add To MetaCart

@TECHREPORT{Reynolds96designof,
    author = {John C. Reynolds},
    title = {Design of the Programming Language Forsythe},
    institution = {},
    year = {1996}
}

Years of Citing Articles

Bookmarks

OpenURL

Abstract:

This is a description of the programming language Forsythe, which is a descendant of Algol 60 intended to be as uniform and general as possible, while retaining the basic character of its progenitor. This document supercedes Report CMU--CS--88--159, "Preliminary Design of the Programming Language Forsythe" [1]. c fl1996 John C. Reynolds Research suuported by National Science Foundation Grant CCR-9409997. Keywords: Forsythe, Algol-like languages, Algol 60, intersection types 1. Introduction In retrospect, it is clear that Algol 60 [2, 3] was an heroic and surprisingly successful attempt to design a programming language from first principles. Its creation gave a formidable impetus to the development and use of theory in language design and implementation, which has borne rich fruit in the intervening thirty-six years. Most of this work has led to languages that are quite different than Algol 60, but there has been a continuing thread of concern with languages that retain the essentia...

Citations

1415	The Definition of Standard ML – Milner, Tofte, et al. - 1990
138	The Next 700 Programming Languages – Landin - 1966
118	Revised report on the algorithmic language Algol 60 – Naur - 1963
60	The Craft of Programming – Reynolds - 1981
52	Scheme: an interpreter for extended lambda calculus – Sussman, Steele - 1975
45	Extended type structures and filter lambda models – Coppo, Honsell, et al. - 1984
43	A Category-Theoretic Approach to the Semantics of Programming Languages – Oles - 1982
40	Revised Report on the Algorithmic Language ALGOL 68 – Wijngaarden - 1974
39	Functional characters of solvable terms. Zeitschrift fur Mathematische Logik und Grundlagen der Mathematik – Coppo, Dezani-Ciancaglini, et al. - 1981
33	Type algebras, functor categories, and block structure – OLES - 1985
17	A contribution to the development of Algol – Wirth, Hoare - 1966
11	A semantics of multiple inheritance, Semantics of Data Types – Cardelli - 1984
11	Types with intersection: An introduction – Hindley - 1991
6	The essence of Algol. In Algorithmic languages – REYNOLDS, C - 1981
1	Programming with Intersection Types and Bounded – Pierce - 1991
1	Conjunctive Types and Algol-like Languages (Abstract of Invited Lecture – Reynolds - 1987
1	The Coherence of Languages with Intersection Types. in: Theoretical Aspects of – Reynolds - 1991