Parameter passing in nondeterministic recursive programs

DOI10.1016/0022-0000(79)90013-8MaRDI QIDQ1131833zbMATH OpenOpenAlexFDO

Authors David B. Benson

Publication date 1979

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0022-0000(79)90013-8

zbMATH Keywords

denotational semanticsleast fixed point semanticsnondeterministic recursive programsparameter passing

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites work

• A Perspective View of Discrete Automata and Their Design
• A Powerdomain Construction
• scientific article; zbMATH DE number 3474936 (Why is no real title available?)
• scientific article; zbMATH DE number 3550181 (Why is no real title available?)
• scientific article; zbMATH DE number 3574936 (Why is no real title available?)
• scientific article; zbMATH DE number 3590261 (Why is no real title available?)
• Matricial theories
• Power domains
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• Thunks

Cited in

(4)

• A theory for nondeterminism, parallelism, communication, and concurrency
• Algebraic solutions to recursion schemes
• scientific article; zbMATH DE number 3772918 (Why is no real title available?)
• Distributive semantics for nondeterministic typed -calculi

This page was built for publication: Parameter passing in nondeterministic recursive programs

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