Expressive power of typed and type-free programming languages

DOI10.1016/0304-3975(84)90088-4MaRDI QIDQ761790zbMATH OpenOpenAlexFDO

Authors Elfriede Fehr

Publication date 1984

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(84)90088-4

zbMATH Keywords

type theorylambda-calculusformal semanticstype-free programming conceptstyped lambda-schemes

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60) Combinatory logic and lambda calculus (03B40) Computability and recursion theory on ordinals, admissible sets, etc. (03D60) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 6823356
• scientific article; zbMATH DE number 3854393
• scientific article; zbMATH DE number 17832
• The expressive power of higher-order types or, life without CONS
• scientific article; zbMATH DE number 4072354

Cites work

• scientific article; zbMATH DE number 3646849 (Why is no real title available?)
• scientific article; zbMATH DE number 3903946 (Why is no real title available?)
• scientific article; zbMATH DE number 3713177 (Why is no real title available?)
• scientific article; zbMATH DE number 3485195 (Why is no real title available?)
• scientific article; zbMATH DE number 3488595 (Why is no real title available?)
• scientific article; zbMATH DE number 3488634 (Why is no real title available?)
• scientific article; zbMATH DE number 3523517 (Why is no real title available?)
• scientific article; zbMATH DE number 3523519 (Why is no real title available?)
• scientific article; zbMATH DE number 3527796 (Why is no real title available?)
• scientific article; zbMATH DE number 3532922 (Why is no real title available?)
• scientific article; zbMATH DE number 3540387 (Why is no real title available?)
• scientific article; zbMATH DE number 3550683 (Why is no real title available?)
• scientific article; zbMATH DE number 3557184 (Why is no real title available?)
• scientific article; zbMATH DE number 3566824 (Why is no real title available?)
• scientific article; zbMATH DE number 3581591 (Why is no real title available?)
• scientific article; zbMATH DE number 3588630 (Why is no real title available?)
• scientific article; zbMATH DE number 3594646 (Why is no real title available?)
• scientific article; zbMATH DE number 3595166 (Why is no real title available?)
• scientific article; zbMATH DE number 3607508 (Why is no real title available?)
• scientific article; zbMATH DE number 3609095 (Why is no real title available?)
• scientific article; zbMATH DE number 3619855 (Why is no real title available?)
• scientific article; zbMATH DE number 3622921 (Why is no real title available?)
• scientific article; zbMATH DE number 3439982 (Why is no real title available?)
• scientific article; zbMATH DE number 3441605 (Why is no real title available?)
• scientific article; zbMATH DE number 3244305 (Why is no real title available?)
• scientific article; zbMATH DE number 3280068 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3311755 (Why is no real title available?)
• scientific article; zbMATH DE number 3342643 (Why is no real title available?)
• scientific article; zbMATH DE number 3362976 (Why is no real title available?)
• scientific article; zbMATH DE number 3378527 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• scientific article; zbMATH DE number 3423547 (Why is no real title available?)
• scientific article; zbMATH DE number 3423994 (Why is no real title available?)
• A draft description of Pascal
• A global representation of the recursive functions in the \(\lambda\)- calculus
• Algebraic automata and context-free sets
• Approximate Reduction and Lambda Calculus Models
• Combinatory logic. Vol. II
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Data Types as Lattices
• Fully abstract models of typed \(\lambda\)-calculi
• IO and OI. II
• Initial Algebra Semantics and Continuous Algebras
• LCF considered as a programming language
• Least fixed points revisited
• On Classes of Program Schemata
• On procedures as open subroutines. II
• Simple program schemes and formal languages
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• The Standardization Theorem for λ‐Calculus
• The lambda calculus, its syntax and semantics
• The programming language Pascal
• Theory of program structures: Schemes, semantics, verification
• λ-definierbare Funktionen auf Peanoalgebren

Cited in

(4)

• On abstraction and the expressive power of programming languages
• On abstraction and the expressive power of programming languages
• On the expressive power of programming languages
• scientific article; zbMATH DE number 709368 (Why is no real title available?)

Describes a project that uses

Uses Software

• ALGOL 60
• LCF
• ALGOL 68

This page was built for publication: Expressive power of typed and type-free programming languages

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