Call-by-name, call-by-value and the -calculus

Cites work

scientific article; zbMATH DE number 3478372 (Why is no real title available?)
scientific article; zbMATH DE number 1142317 (Why is no real title available?)
scientific article; zbMATH DE number 3280068 (Why is no real title available?)
scientific article; zbMATH DE number 3322510 (Why is no real title available?)
scientific article; zbMATH DE number 3423547 (Why is no real title available?)
A simplification of combinatory logic
Continuations: A mathematical semantics for handling full jumps
Correspondence between ALGOL 60 and Church's Lambda-notation
Definitional interpreters for higher-order programming languages
GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept
The Mechanical Evaluation of Expressions

Cited in

(only showing first 100 items - show all)

On the strong normalisation of intuitionistic natural deduction with permutation-conversions
A Process-Model for Linear Programs
Synthesis of ML programs in the system Coq
Axioms for control operators in the CPS hierarchy
Syntactic theories in practice
How to prove decidability of equational theories with second-order computation analyser SOL
On the equivalence between small-step and big-step abstract machines: a simple application of lightweight fusion
A formalized general theory of syntax with bindings: extended version
Game-theoretic analysis of call-by-value computation
Proofs of strong normalisation for second order classical natural deduction
A functional correspondence between call-by-need evaluators and lazy abstract machines
The locally nameless representation
Completeness of intersection and union type assignment systems for call-by-value \(\lambda\)-models
Theory of interaction
Computational interpretations of linear logic
Semantics of higher-order quantum computation via geometry of interaction
A partial evaluator for the untyped lambda-calculus
Variations on mobile processes
A two-level logic approach to reasoning about computations
A confluent calculus for concurrent constraint programming
Relating Functional and Imperative Session Types
An abstract framework for environment machines
Access control in a core calculus of dependency
From reduction-based to reduction-free normalization
Functions as processes
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence
Peter J. Landin (1930--2009)
scientific article; zbMATH DE number 1522507 (Why is no real title available?)
Processes and games
Lazy rewriting and eager machinery
scientific article; zbMATH DE number 2156365 (Why is no real title available?)
On the unity of duality
A structural approach to reversible computation
The origins of structural operational semantics
A theory for program and data type specification
Proving the correctness of recursion-based automatic program transformations
Completeness of continuation models for \(\lambda_\mu\)-calculus
A first order logic of effects
Proving the correctness of recursion-based automatic program transformations
Classical logic, storage operators and second-order lambda-calculus
Probabilistic operational semantics for the lambda calculus
A syntactic correspondence between context-sensitive calculi and abstract machines
Call-by-value non-determinism in a linear logic type discipline
Optimal solutions to pattern matching problems
A two-valued logic for properties of strict functional programs allowing partial functions
LCF considered as a programming language
Combining algebraic effects with continuations
The revised report on the syntactic theories of sequential control and state
Notions of computation and monads
The Impact of the Lambda Calculus in Logic and Computer Science
Representing Control: a Study of the CPS Transformation
Confluence in probabilistic rewriting
Representing Control: a Study of the CPS Transformation
A mathematical semantics for a nondeterministic typed lambda-calculus
Pedagogical second-order \(\lambda \)-calculus
From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models
Order-enriched categorical models of the classical sequent calculus
Parametric parameter passing \(\lambda\)-calculus
Using typed lambda calculus to implement formal systems on a machine
Compilation of extended recursion in call-by-value functional languages
Actor languages. Their syntax, semantics, translation, and equivalence
Transparent quantification into hyperintensional objectual attitudes
Refunctionalization at work
Extensional Logic of Hyperintensions
The spirit of ghost code
A new deconstructive logic: linear logic
On categorical models of classical logic and the Geometry of Interaction
CPS-translation as adjoint
On graph rewriting, reduction, and evaluation in the presence of cycles
Comprehending monads
Domain-free \(\lambda\mu\)-calculus
Programs as data structures in \(\lambda\)SF-calculus
Delimited control operators prove double-negation shift
A syntactic theory of sequential control
The untyped computational \(\lambda \)-calculus and its intersection type discipline
Modelling and analysing neural networks using a hybrid process algebra
Strong normalization from an unusual point of view
Type checking and typability in domain-free lambda calculi
Equivalence in functional languages with effects
Introduction to Type Theory
Safety of Nöcker's strictness analysis
Call-by-value Solvability
Deriving a Floyd-Hoare logic for non-local jumps from a formulæ-as-types notion of control
A syntactic theory of sequential state
Inferring the equivalence of functional programs that mutate data
Parametric \(\lambda \)-theories
CPS transformation of beta-redexes
A proof theoretical approach to communication
Game semantics and linear CPS interpretation
On the semantics of the call-by-name CPS transform
A simplifier for untyped lambda expressions
Intensional computation with higher-order functions
The simple type theory of normalisation by evaluation
Strong normalization proof with CPS-translation for second order classical natural deduction
A short proof of the lexical addressing algorithm
A functional correspondence between monadic evaluators and abstract machines for languages with computational effects
Correctness of procedure representations in higher-order assembly language
From operational semantics to abstract machines
A general storage theorem for integers in call-by-name \(\lambda\)- calculus
A constructive logic behind the catch and throw mechanism

Describes a project that uses

Uses Software

ALGOL 60

This page was built for publication: Call-by-name, call-by-value and the \(\lambda\)-calculus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1225449)