Equational specification of abstract types and combinators

2005 ◽  
pp. 257-271 ◽  
Author(s):  
Karl Meinke
Keyword(s):  
Abstract Types

Distrbution and Abstract Types in Emerald

1987 ◽  
Vol SE-13 (1) ◽  
pp. 65-76 ◽  
Author(s):  
A. Black ◽  
N. Hutchinson ◽  
E. Jul ◽  
H. Levy ◽  
L. Carter
Keyword(s):  
Abstract Types

Abstract Types

2013 ◽  
pp. 162-169
Author(s):  
Robert Harper
Keyword(s):  
Abstract Types

Abstract types defined as classes of variables

1976 ◽  
Vol 11 (SI) ◽  
pp. 149-154 ◽  
Author(s):  
D. L. Parnas ◽  
John E. Shore ◽  
David Weiss
Keyword(s):  
Abstract Types

Generic top-down discrimination for sorting and partitioning in linear time

2012 ◽  
Vol 22 (3) ◽  
pp. 300-374 ◽  
Author(s):  
FRITZ HENGLEIN
Keyword(s):  
Linear Time ◽  
Source Code ◽  
Equivalence Relations ◽  
Asymptotic Performance ◽  
Data Types ◽  
Worst Case ◽  
First Order ◽  
Structural Recursion ◽  
Algebraic Data Types ◽  
Abstract Types

AbstractWe introduce the notion ofdiscriminationas a generalization of both sorting and partitioning, and show thatdiscriminators(discrimination functions) can be definedgenerically, by structural recursion on representations oforderingandequivalence relations. Discriminators improve the asymptotic performance of generic comparison-based sorting and partitioning, and can be implemented not to expose more information than the underlying ordering, respectively equivalence relation. For a large class of order and equivalence representations, including all standard orders for regular recursive first-order types, the discriminators execute in the worst-case linear time. The generic discriminators can be coded compactly using list comprehensions, with order and equivalence representations specified using Generalized Algebraic Data Types. We give some examples of the uses of discriminators, including the most-significant digit lexicographic sorting, type isomorphism with an associative-commutative operator, and database joins. Source code of discriminators and their applications in Haskell is included. We argue that built-in primitive types, notably pointers (references), should come with efficient discriminators, not just equality tests, since they facilitate the construction of discriminators for abstract types that are both highly efficient and representation-independent.

Polymorphism, objects and abstract types

1998 ◽  
Vol 29 (4) ◽  
pp. 39-50
Author(s):  
Peter W. O'Hearn
Keyword(s):  
Abstract Types

Modules, abstract types, and distributed versioning

2001 ◽  
Vol 36 (3) ◽  
pp. 236-247
Author(s):  
Peter Sewell
Keyword(s):  
Abstract Types

ChemInform Abstract: Types of Cationic Complexes Based on Oxocentred Tetrahedra [OM4] in the Crystal Structure of Inorganic Compounds

ChemInform ◽  
2010 ◽  
Vol 29 (30) ◽  
pp. no-no
Author(s):  
S. V. KRIVOVICHEV ◽  
S. K. FILATOV ◽  
T. F. SEMENOVA
Keyword(s):  
Crystal Structure ◽  
Inorganic Compounds ◽  
Abstract Types

scholarly journals An existential crisis resolved: type inference for first-class existential types

2021 ◽  
Vol 5 (ICFP) ◽  
pp. 1-29
Author(s):  
Richard A. Eisenberg ◽  
Guillaume Duboc ◽  
Stephanie Weirich ◽  
Daniel Lee
Keyword(s):  
Pattern Matching ◽  
Type Inference ◽  
Great Success ◽  
Inference Algorithm ◽  
Existential Crisis ◽  
Refinement Types ◽  
Core Language ◽  
Abstract Types

Despite the great success of inferring and programming with universal types, their dual—existential types—are much harder to work with. Existential types are useful in building abstract types, working with indexed types, and providing first-class support for refinement types. This paper, set in the context of Haskell, presents a bidirectional type-inference algorithm that infers where to introduce and eliminate existentials without any annotations in terms, along with an explicitly typed, type-safe core language usable as a compilation target. This approach is backward compatible. The key ingredient is to use strong existentials, which support (lazily) projecting out the encapsulated data, not weak existentials accessible only by pattern-matching.

Object-oriented programming

2018 ◽  
Author(s):  
Michael Metcalf ◽  
John Reid ◽  
Malcolm Cohen
Keyword(s):  
Data Structures ◽  
Object Oriented ◽  
Object Oriented Programming ◽  
Language Support ◽  
Data Object ◽  
Object Oriented Approach ◽  
Definition Of ◽  
Abstract Types ◽  
Oriented Approach ◽  
Special Language

The object-oriented approach to programming and design is characterized by its focus on the data structures of a program rather than the procedures. Often, invoking a procedure with a data object as its principal argument is thought of as ‘sending a message’ to the object. Special language support is typically available for collecting these procedures (sometimes known as ‘methods’) together with the definition of the type of the object. This approach is supported in Fortran by type extension, polymorphic variables, type-bound procedures, abstract types, and finalization.

Sign in / Sign up

Export Citation Format

Share Document