Reduction in a linear lambda-calculus with applications to operational semantics

DOI10.1007/978-3-540-32033-3_17MaRDI QIDQ5703851zbMATH OpenOpenAlexFDO

Authors Alex Simpson

Publication date 11 November 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135673, https://www.research.ed.ac.uk/en/publications/a5409486-9c6b-4db6-9698-d8656f5f4516

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Semantics in the theory of computing (68Q55)

Recommendations

• Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
• Linear -reduction
• scientific article; zbMATH DE number 1547348
• A Terminating and Confluent Linear Lambda Calculus
• scientific article; zbMATH DE number 7204428

Cited in

(29)

• Quantum implicit computational complexity
• Needed reduction and spine strategies for the lambda calculus
• Factorization in call-by-name and call-by-value calculi via linear logic
• Reduction and introducers in \(d\)-contexts
• Confluence in probabilistic rewriting
• A symbolic and algebraic computation based lambda-Boolean reduction machine via PROLOG
• Confluence results for a quantum lambda calculus with measurements
• Metric reasoning about -terms: the general case
• Semantics of higher-order quantum computation via geometry of interaction
• Linear time self-interpretation of the pure lambda calculus
• scientific article; zbMATH DE number 1547348 (Why is no real title available?)
• scientific article; zbMATH DE number 3997138 (Why is no real title available?)
• Refining reduction in the lambda calculus
• Reducibility Proofs in the λ-Calculus
• Operational properties of \texttt{Lily}, a polymorphic linear lambda calculus with recursion
• Separating weakening and contraction in a linear lambda calculus
• Linear -reduction
• lambda!-calculus, Intersection Types, and Involutions
• Probabilistic rewriting: normalization, termination, and unique normal forms
• Probabilistic rewriting and asymptotic behaviour: on termination and unique normal forms
• scientific article; zbMATH DE number 7204428 (Why is no real title available?)
• scientific article; zbMATH DE number 7084951 (Why is no real title available?)
• On reduction and normalization in the computational core
• Processes, Terms and Cycles: Steps on the Road to Infinity
• Exponentials as Substitutions and the Cost of Cut Elimination in Linear Logic
• Exponentials as substitutions and the cost of cut elimination in linear logic
• Categorifying non-idempotent intersection types
• A rewriting theory for quantum -calculus
• Combinatory completeness instructured multicategories

This page was built for publication: Reduction in a linear lambda-calculus with applications to operational semantics

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