Correctness of a lucid interpreter based on linked forest manipulation systems

DOI10.1080/00207168008803187zbMath0427.68014OpenAlexW1973117609WikidataQ126245989 ScholiaQ126245989MaRDI QIDQ3863037

Mansour Farah

Publication date: 1980

Published in: International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207168008803187

zbMATH Keywords

correctnessprogramming languagessemanticssyntax

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
• Lucid, a nonprocedural language with iteration
• Lucid—A Formal System for Writing and Proving Programs
• A model for the formal definition of programming languages

This page was built for publication: Correctness of a lucid interpreter based on linked forest manipulation systems