scientific article; zbMATH DE number 3607508
From MaRDI portal
Publication:4172933
zbMath0391.68041MaRDI QIDQ4172933
No author found.
Publication date: 1978
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
SemanticsLambda-CalculusProgramming LanguageFormal LanguagesDenotational SemanticsHigher Type RecursionTree Languages
Formal languages and automata (68Q45) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40)
Related Items (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 ⋮ The formal termination problem for programs with finite ALGOL 68-modes ⋮ The IO- and OI-hierarchies ⋮ On termination problems for finitely interpreted ALGOL-like programs ⋮ Expressive power of typed and type-free programming languages
This page was built for publication: