scientific article; zbMATH DE number 7204561

DOI10.4230/LIPICS.ICALP.2017.109zbMATH Open1442.03009arXiv1501.06522MaRDI QIDQ5111441FDOQ5111441

Authors: Gilles Dowek 

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1501.06522

Title of this publication is not available (Why is that?)

Recommendations

• Termination Modulo Combinations of Equational Theories
• Reducibility Proofs in the λ-Calculus
• Decomposition theorems and model-checking for the modal \(\mu\)-calculus
• scientific article; zbMATH DE number 1330425
• Models for the computational \(\lambda\)-calculus
• CONCUR 2005 – Concurrency Theory
• Terminating calculi and countermodels for constructive modal logics
• A finite model theorem for the propositional \(\mu\)-calculus
• On modular termination proofs of general logic programs
• scientific article; zbMATH DE number 2174387

zbMATH Keywords

simple type theorycalculus of constructionsproof reduction

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40)

Cited In (7)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On the convergence of reduction-based and model-based methods in proof theory
• Title not available (Why is that?)
• Termination Modulo Combinations of Equational Theories
• Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo
• A modular construction of type theories

This page was built for publication:

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