An ``executable impredicative semantics for the Ada configuration

DOI10.1007/BF01211301MaRDI QIDQ2366693zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 18 August 1993

Published in Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf01211301

zbMATH Keywords

Adaconfiguration descriptionhigher order typed functional languagesstatic semanticstype theory

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)

Recommendations

• A Proof System for Ada Tasks
• A proof system for concurrent ADA programs
• scientific article; zbMATH DE number 3765722
• scientific article; zbMATH DE number 3978353

Cites work

• Pebble, a kernel language for modules and abstract data types

Cited in

(1)

• From ML to Ada: Strongly-typed language interoperability via source translation

Describes a project that uses

Uses Software

• Ada95

This page was built for publication: An ``executable impredicative semantics for the Ada configuration

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