 |
|
What people are saying - Write a reviewWe haven't found any reviews in the usual places. Related books
Contents
24 other sections not shown Other editions - View allCommon terms and phrasesabstraction Algol 60 algorithm applied argument assume axiom of extensionality basis elements call by value Chapter Christopher Strachey command complete lattice completely strict component conditional consider continuous functions continuous lattice corresponding Curry denotational semantics directed set element of Pu environment evaluation example Exercise exists expression false finite fix(H fixed point operator fixpoint induction flat lattice formal semantics free variables give goto idempotent implementation integers introduce jump-free jumps LAMBDA Lemma machine code mapping mathematical method Milne monotonic normal form notation Notice numerals occur free parameter particular predicates primitive primitive recursive function programming languages proof prove R-value recursive referentially transparent result retract semantic definitions semantic equations semantic function sequence side effects simple specify stack standard semantics Strachey subset syntactic Syntactic Categories syntax technique terminate Theorem tion true truth values Value Domains value space X-calculus X-expressions References to this bookFrom other books
From Google ScholarA Structural Approach to Operational SemanticsGordon D Plotkin Algebraic Laws for Nondeterminism and ConcurrencyMATTHEW HENNESSY, ROBIN MILNER Testing Equivalences For ProcessesR de Nicola, MCB Hennessy Functional Programming with Bananas, Lenses, Envelopes and Barbed WireErik Meijer, Maarten Fokkinga, Ross Paterson References from web pagesDenotational Semantics SS > NF reviews > Joseph E. Stoy Dana Scott Black Oak Books at antiqbook.com A Linguagem TC lambda Современные языки программирования и .NET. Основы объектно ... Cat. Letteratura Grigia - Copie Descles: Programme interdisciplinaire de traitement formel et ... Bibliographic information
|
