Semantic properties of Lucid's compute clause and its compilation

DOI10.1007/BF00288532zbMath0402.68006OpenAlexW2064553030MaRDI QIDQ1255778

Christoph M. Hoffmann

Publication date: 1980

Published in: Acta Informatica (Search for Journal in Brave)

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

zbMATH Keywords

Compilation AlgorithmsCorrectness ProofNested Clause StructuresProgramming Language Lucid

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Proof techniques for hierarchically structured programs
• Lucid—A Formal System for Writing and Proving Programs

This page was built for publication: Semantic properties of Lucid's compute clause and its compilation