A Simple and General Theoretical Account for Abstract Types

No abstract is available for this paper.

• Publication year

  2009

• Venue

  Brazilian Symposium on Formal Methods

• Publication date

  2009-11-05

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/978-3-642-10452-7_23
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Curry-Style Types for Nominal Terms

  2006cited by this paper
• A type system for higher-order modules

  2003cited by this paper
• Applied Type System: Extended Abstract

  2003cited by this paper
• Guarded recursive datatype constructors

  2003cited by this paper
• First class modules for Haskell

  2002cited by this paper
• First-Class Structures for Standard ML

  2000cited by this paper
• What is a recursive module?

  1999cited by this paper
• Dependent types in practical programming

  1999cited by this paper
• The Definition of Standard ML (Revised)

  1997cited by this paper
• Translucent Sums: A Foundation for Higher-Order Module Systems

  1997cited by this paper
• Applicative functors and fully transparent higher-order modules

  1995cited by this paper
• A type-theoretic approach to higher-order modules with sharing

  1994cited by this paper
• Manifest types, modules, and separate compilation

  1994cited by this paper
• Imperative functional programming

  1993cited by this paper
• Abstract Types and the Dot Notation

  1990cited by this paper
• Static dependent types for first class modules

  1990cited by this paper
• The Modula–3 type system

  1989cited by this paper
• Abstract types have existential type

  1988cited by this paper
• Using dependent types to express modular structure

  1986cited by this paper
• Abstraction and Specification in Program Development

  1986cited by this paper
• Abstract types have existential types

  1985cited by this paper
• The Larch Family of Specification Languages

  1985cited by this paper
• Programming in Modula-2

  1982cited by this paper

• To Memory Safety through Proofs

  2018cites this paper