The Mechanical Evaluation of Expressions
From MaRDI portal
Publication:5734774
DOI10.1093/comjnl/6.4.308zbMath0122.36106OpenAlexW2113757735WikidataQ30040385 ScholiaQ30040385MaRDI QIDQ5734774
Publication date: 1964
Published in: The Computer Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1093/comjnl/6.4.308
Related Items
Semantics of context-free languages, Programming language semantics: It’s easy as 1,2,3, Automating the functional correspondence between higher-order evaluators and abstract machines, The average size of ordered binary subgraphs, Control-flow analysis of function calls and returns by abstract interpretation, Capsules and Closures, Compiling Collapsing Rules in Certain Constructor Systems, The origins of structural operational semantics, Systematic abstraction of abstract machines, A constructive logic behind the catch and throw mechanism, Parametric parameter passing \(\lambda\)-calculus, Combinatory reduction systems with explicit substitution that preserve strong normalisation, On the enumeration of closures and environments with an application to random generation, Needed reduction and spine strategies for the lambda calculus, Label-selective \(\lambda\)-calculus syntax and confluence, Peter J. Landin (1930--2009), A syntactic theory of sequential control, From operational semantics to abstract machines, A Complete, Co-inductive Syntactic Theory of Sequential Control and State, Conflation Confers Concurrency, Cutting Out Continuations, A functional correspondence between call-by-need evaluators and lazy abstract machines, A concurrent lambda calculus with futures, A two-level logic approach to reasoning about computations, On explicit substitution with names, A functional computation model for the duality of two-variable lambda-Boolean functions, Getting There and Back Again, A lazy desugaring system for evaluating programs with sugars, On the value of variables, Unnamed Item, A framework for verifying bit-level pipelined machines based on automated deduction and decision procedures, Inheritance hierarchies: Semantics and unifications, The Peter Landin prize, A syntactic correspondence between context-sensitive calculi and abstract machines, Functions as processes, An observationally complete program logic for imperative higher-order functions, Specification patterns for reasoning about recursion through the store, A first order logic of effects, The definition of Extended ML: A gentle introduction, Extracting functional programs from Coq, in Coq, Unnamed Item, Abstract machines, optimal reduction, and streams, Inter-deriving Semantic Artifacts for Object-Oriented Programming, On inter-deriving small-step and big-step semantics: a case study for storeless call-by-need evaluation, iRho: an imperative rewriting calculus, Unnamed Item, A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation, No value restriction is needed for algebraic effects and handlers, Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control, Alpha conversion, conditions on variables and categorical logic, On the semantics of parsing actions, A survey of state vectors, Algebraic models of correctness for abstract pipelines., Safe functional systems through integrity types and verified assembly, The Impact of the Lambda Calculus in Logic and Computer Science, State-transition machines for lambda-calculus expressions, The next 700 Krivine machines, A call-by-name lambda-calculus machine, A static simulation of dynamic delimited control, The chemical abstract machine, Proving correctness of a compiler using step-indexed logical relations, An implementation of syntax directed functional programming on nested- stack machines, On the concurrent computational content of intermediate logics, Computational interpretations of linear logic, The revised report on the syntactic theories of sequential control and state, Computation, hypercomputation, and physical science, On graph rewriting, reduction, and evaluation in the presence of cycles, On Extracting Static Semantics, Reasoning about B+ Trees with Operational Semantics and Separation Logic, On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion, New Developments in Environment Machines, An abstract monadic semantics for value recursion, A verified framework for higher-order uncurrying optimizations, Evaluating lambda terms with traversals, Typing termination in a higher-order concurrent imperative language, Inter-deriving semantic artifacts for object-oriented programming, Call-by-name, call-by-value and the \(\lambda\)-calculus, Language design methods based on semantic principles, Equivalence in functional languages with effects, Abstract λ-Calculus Machines, Least fixed points revisited, Algebraic correctness proofs for compiling recursive function definitions with strictness information, Call-by-value Solvability, A new implementation technique for applicative languages, Constructive Mathematics and Functional Programming (Abstract), On the design and specification of message oriented programs, Coinductive big-step operational semantics, A syntactic theory of sequential state, Unnamed Item, Unnamed Item, Specification Patterns and Proofs for Recursion through the Store, Algebraic models of microprocessors architecture and organisation, The lambda-gamma calculus: A language adequate for defining recursive functions, Primitives for resource management in a demand-driven reduction model, Formalizing Operational Semantic Specifications in Logic, A Resource-Aware Semantics and Abstract Machine for a Functional Language with Explicit Deallocation, From Reduction-Based to Reduction-Free Normalization, ETA-RULES IN MARTIN-LÖF TYPE THEORY, A functional correspondence between monadic evaluators and abstract machines for languages with computational effects, Lambda-dropping: Transforming recursive equations into programs with block structure, From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models, Encoding many-valued logic in $\lambda$-calculus, Perpetuality and uniform normalization in orthogonal rewrite systems, Remarks on Testing Probabilistic Processes, An abstract framework for environment machines, Definition of the semantics of programming language constructs in terms of ?-calculus. I, A variadic extension of Curry's fixed-point combinator
