Typed Lambda Calculi and Applications
From MaRDI portal
Recommendations
- Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ-Calculus
- Weak completeness of type assignment in -calculus models: A generalization of Hindley's result
- A completeness result for the simply typed \(\lambda \mu \)-calculus
- scientific article; zbMATH DE number 2185676
- scientific article; zbMATH DE number 1841836
Cited in
(35)- On the completeness of order-theoretic models of the \(\lambda \)-calculus
- Decidability of the restriction equational theory in the partial lambda calculus
- Completeness theorem for Dummett's LC quantified and some of its extensions
- A theory of strict P-completeness
- Krivine's intuitionistic proof of classical completeness (for countable languages)
- Statman's 1-section theorem
- Finite generation and presentation problems for lambda calculus and combinatory logic
- Completeness of continuation models for \(\lambda_\mu\)-calculus
- Nonmodularity results for lambda calculus
- Term collections in {\(\lambda\)} and {\(\rho\)}-calculi
- scientific article; zbMATH DE number 2185676 (Why is no real title available?)
- scientific article; zbMATH DE number 3853065 (Why is no real title available?)
- scientific article; zbMATH DE number 6538188 (Why is no real title available?)
- Complete Coinductive Theories. I
- Remarks on Semantic Completeness for Proof-Terms with Laird’s Dual Affine/Intuitionistic λ-Calculus
- scientific article; zbMATH DE number 5649339 (Why is no real title available?)
- Completeness Results for Lambek Syntactic Calculus
- Completeness of transfinite evaluation in an extension of the lambda calculus
- On Proving Limiting Completeness
- scientific article; zbMATH DE number 4057495 (Why is no real title available?)
- scientific article; zbMATH DE number 4059375 (Why is no real title available?)
- scientific article; zbMATH DE number 1342246 (Why is no real title available?)
- scientific article; zbMATH DE number 475195 (Why is no real title available?)
- The basis decision problem in λ‐calculus
- An alternate proof of Statman's finite completeness theorem
- How to assign ordinal numbers to combinatory terms with polymorphic types
- scientific article; zbMATH DE number 1841836 (Why is no real title available?)
- L-Completeness of the Lambek Calculus with the Reversal Operation
- Formal SOS-Proofs for the Lambda-Calculus
- scientific article; zbMATH DE number 5208767 (Why is no real title available?)
- scientific article; zbMATH DE number 5060344 (Why is no real title available?)
- The Tractarian operation \(N\) and expressive completeness
- A completeness result for the simply typed \(\lambda \mu \)-calculus
- Weak completeness of type assignment in -calculus models: A generalization of Hindley's result
- A completeness result for a realisability semantics for an intersection type system
This page was built for publication: Typed Lambda Calculi and Applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704003)
