Some ideas on data types in high-level languages

DOI10.1145/359605.359624zbMath0358.68045OpenAlexW2028440485MaRDI QIDQ4130984

Narain Gehani, David Gries

Publication date: 1977

Published in: Communications of the ACM (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/6563

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (10)

A taxonomy of binary tree traversals ⋮ Zur Verbesserung der Lokalität im Zugriff auf Felder ⋮ Abstract for-loops over several aggregates ⋮ Verification of a finite iteration over data structures ⋮ On a new approach to representation independent data classes ⋮ Axioms for user-defined operators ⋮ A new data structure - the grid ⋮ Symbolic Verification Method for Definite Iterations over Tuples of Altered Data Structures and Its Application to Pointer Programs ⋮ A theory of type polymorphism in programming ⋮ Symbolic verification method for definite iteration over data structures

This page was built for publication: Some ideas on data types in high-level languages