Call-by-value Solvability

DOI10.1051/ITA:1999130zbMATH Open0958.68061DBLPjournals/ita/PaoliniR99OpenAlexW2130601506WikidataQ57722215 ScholiaQ57722215MaRDI QIDQ4953339FDOQ4953339

Authors: Luca Paolini, Simona Ronchi Della Rocca 

Publication date: 9 May 2000

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92618

Recommendations

• Call-by-value solvability, revisited
• A Semantical and Operational Account of Call-by-Value Solvability
• No solvable lambda-value term left behind
• Standardization of a Call-By-Value Lambda-Calculus
• Solvability = typability + inhabitation

zbMATH Keywords

solvability\(\lambda\)-calculus

Mathematics Subject Classification ID

Turing machines and related notions (03D10)

Cites Work

• Call-by-name, call-by-value and the \(\lambda\)-calculus
• Title not available (Why is that?)
• The lambda calculus. Its syntax and semantics. Rev. ed.
• A Syntactic Characterization of the Equality in Some Models for the Lambda Calculus
• A filter lambda model and the completeness of type assignment
• The Relation between Computational and Denotational Properties for Scott’s ${\text{D}}_\infty $-Models of the Lambda-Calculus
• The Mechanical Evaluation of Expressions
• Full abstraction in the lazy lambda calculus
• An approximation theorem for topological lambda models and the topological incompleteness of lambda calculus
• Title not available (Why is that?)

Cited In (19)

• Strong normalization from an unusual point of view
• Linearity, non-determinism and solvability
• Parametric parameter passing \(\lambda\)-calculus
• Strong call-by-value and multi types
• A Fresh Look at the λ-Calculus
• Solvability = typability + inhabitation
• A Semantical and Operational Account of Call-by-Value Solvability
• Open call-by-value
• Title not available (Why is that?)
• System \(T\), call-by-value and the minimum problem
• Title not available (Why is that?)
• Proof nets and the call-by-value \(\lambda\)-calculus
• Light genericity
• Calculi, types and applications: essays in honour of M. Coppo, M. Dezani-Ciancaglini and S. Ronchi della Rocca
• Head reduction and normalization in a call-by-value lambda-calculus
• Solvability for generalized applications
• Call-by-value solvability, revisited
• Implementing open call-by-value
• Title not available (Why is that?)

Uses Software

• ML
• Haskell

This page was built for publication: Call-by-value Solvability

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