Parameter passing in nondeterministic recursive programs

DOI10.1016/0022-0000(79)90013-8zbMath0418.68011OpenAlexW2025620809MaRDI QIDQ1131833

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 semanticsparameter passingleast fixed point semanticsnondeterministic recursive programs

Mathematics Subject Classification ID

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

Related Items (4)

A theory for nondeterminism, parallelism, communication, and concurrency ⋮ Algebraic solutions to recursion schemes ⋮ Unnamed Item ⋮ Distributive semantics for nondeterministic typed \(\lambda\)-calculi

Cites Work

• Matricial theories
• Power domains
• Thunks
• The Semantics of Call-By-Value and Call-By-Name in a Nondeterministic Environment
• A Powerdomain Construction
• A Perspective View of Discrete Automata and Their Design
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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