Logic operators and quantifiers in type-theory of algorithms

DOI10.1007/978-3-031-43977-3_11zbMATH Open1542.03039MaRDI QIDQ6560410FDOQ6560410

Authors: Roussanka Loukanova 

Publication date: 21 June 2024

Recommendations

• Semantics of propositional attitudes in type-theory of algorithms
• Equational type logic
• scientific article; zbMATH DE number 851066
• Incorporating quotation and evaluation into Church's type theory
• scientific article; zbMATH DE number 559219

zbMATH Keywords

recursiondenotational semanticsquantifierslogic operatorstype-theoryreduction calculusalgorithmic semanticsacyclic algorithms

Mathematics Subject Classification ID

Combinatory logic and lambda calculus (03B40) Logic in computer science (03B70) Type theory (03B38)

Cites Work

• A theory of type polymorphism in programming
• LCF considered as a programming language
• Title not available (Why is that?)
• Title not available (Why is that?)
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• The Mechanical Evaluation of Expressions
• The formal language of recursion
• Title not available (Why is that?)
• Gamma-reduction in type theory of acyclic recursion

Cited In (1)

• Semantics of propositional attitudes in type-theory of algorithms

This page was built for publication: Logic operators and quantifiers in type-theory of algorithms

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