scientific article; zbMATH DE number 3607508

MaRDI QIDQ4172933zbMATH OpenFDO

Authors

Publication date 1978

zbMATH Keywords

SemanticsLambda-CalculusProgramming LanguageFormal LanguagesDenotational SemanticsHigher Type RecursionTree Languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55)

Cited in

(6)

• A polynomial determination of the most-recent property in Pascal-like programs
• Equivalences and transformations of regular systems - applications to recursive program schemes and grammars
• On termination problems for finitely interpreted ALGOL-like programs
• The IO- and OI-hierarchies
• Expressive power of typed and type-free programming languages
• The formal termination problem for programs with finite ALGOL 68-modes

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4172933)