A theory for program and data type specification (Q1199933): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(6 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Carolyn L. Talcott / rank
Normal rank
 
Property / reviewed by
 
Property / reviewed by: Q792453 / rank
Normal rank
 
Property / author
 
Property / author: Carolyn L. Talcott / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Anatoly V. Anisimov / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: ALGOL 60 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LISP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3686011 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679172 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial abstract types / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic definition of programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stream Processing Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Design of a separable transition-diagram compiler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3709890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4128540 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3882452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3663255 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4723729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3478384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A syntactic theory of sequential control / rank
 
Normal rank
Property / cites work
 
Property / cites work: The revised report on the syntactic theories of sequential control and state / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simplifier for untyped lambda expressions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correspondence between ALGOL 60 and Church's Lambda-notation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The next 700 programming languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3202991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Call-by-name, call-by-value and the \(\lambda\)-calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5685626 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997095 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheme: A interpreter for extended lambda calculus / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(92)90169-g / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2012140088 / rank
 
Normal rank

Latest revision as of 10:10, 30 July 2024

scientific article
Language Label Description Also known as
English
A theory for program and data type specification
scientific article

    Statements

    A theory for program and data type specification (English)
    0 references
    17 January 1993
    0 references
    This is an attempt to develop a wide spectrum formalism which will support not only reasoning about program equivalence, but also covers reasoning about some properties of computations, specifications of programs and data types. The first-order, two-layered theory which is called IOCC (impredective theory of operations, control and classes) was created for these purposes. The lower layer is a theory of program equivalence and definedness. The upper layer is a theory of class membership with a general principle for defining classes. Examples are given to illustrate the reasoning about programs, steams and coroutines.
    0 references
    program equivalence
    0 references
    reasoning about programs
    0 references
    0 references
    0 references
    0 references

    Identifiers