Expressive power of typed and type-free programming languages

DOI10.1016/0304-3975(84)90088-4zbMATH Open0557.68022OpenAlexW2081900912MaRDI QIDQ761790FDOQ761790

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

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

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)

Cites Work

• LCF considered as a programming language
• IO and OI. II
• Initial Algebra Semantics and Continuous Algebras
• Title not available (Why is that?)
• Title not available (Why is that?)
• Data Types as Lattices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The lambda calculus, its syntax and semantics
• Combinatory logic. Vol. II
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• Approximate Reduction and Lambda Calculus Models
• Correspondence between ALGOL 60 and Church's Lambda-notation
• Simple program schemes and formal languages
• Algebraic automata and context-free sets
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fully abstract models of typed \(\lambda\)-calculi
• Theory of program structures: Schemes, semantics, verification
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The programming language Pascal
• Title not available (Why is that?)
• Title not available (Why is that?)
• A global representation of the recursive functions in the \(\lambda\)- calculus
• On procedures as open subroutines. II
• Title not available (Why is that?)
• Title not available (Why is that?)
• Least fixed points revisited
• Title not available (Why is that?)
• Title not available (Why is that?)
• The Standardization Theorem for λ‐Calculus
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A draft description of Pascal
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Classes of Program Schemata
• λ-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
• Title not available (Why is that?)
• On the expressive power of programming languages

Uses Software

• ALGOL 68
• LCF
• ALGOL 60

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)