article · 1992

A static semantics for Haskell

Simon Peyton, Philip Wadler

Cited by 0Abstract and details only

Abstract

This paper gives a static semantics for a large subset of Haskell, including giving a translation into a language without overloading. It is our intention to cover the complete language in due course. One innovative aspect is the use of ideas from the second-order lambda calculus to record type information in the program. Contents 1 Introduction 4 2 A sketch of how overloading is resolved 6 3 Notation 7 4 Abstract syntax 13 5 Programs 19 6 Type declarations 21 7 Class declarations 24 8 Instance declarations 26 9 Value declarations 28 10 Expressions 37 11 Pattern matching 40 12 Dictionary manipulation 45 13 Implementation notes 47 14 References 47 List of Figures 1 Syntax of semantic types : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 10 2 Environments : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 11 3 Abstract syntax for Haskell: declarations and bindings : : : : : : : : : : : : : 14 4 Abstract syntax of Haskell: patterns and expressions : : ...

Cite this paper

APA 7

Peyton, S., & Wadler, P. (1992). A static semantics for Haskell.

MLA 9

Peyton, Simon, and Philip Wadler. “A static semantics for Haskell.” 1992.

Chicago

Peyton, Simon, and Philip Wadler. 1992. “A static semantics for Haskell.”

Harvard

Peyton, S. and Wadler, P. (1992) ‘A static semantics for Haskell’.

BibTeX

@article{peyton1992static,
  title = {{A static semantics for Haskell}},
  author = {Peyton, Simon and Wadler, Philip},
  year = {1992}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.