scientific article; zbMATH DE number 53088
From MaRDI portal
Publication:4003339
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Subsystems of classical logic (including intuitionistic logic) (03B20) Combinatory logic and lambda calculus (03B40) Structure of proofs (03F07) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Theory of programming languages (68N15) Grammars and rewriting systems (68Q42)
Recommendations
Cited in
(35)- A rigorous methodology for specification and verification of business processes
- Set theory for verification. I: From foundations to functions
- A constructive approach to state description semantics
- Types for modules
- Probabilistic reasoning in a classical logic
- Types and programing languages
- Supercompilation for Martin-Lof's type theory
- Extension of the formal system of the theory of expressions with arities and its strong normalization property
- Domain-Theoretic Foundations of Functional Programming
- Certifying supercompilation for Martin-Löf's type theory
- Fundamentals of coding type problems
- scientific article; zbMATH DE number 4002073 (Why is no real title available?)
- Intuitionistic completeness of first-order logic
- scientific article; zbMATH DE number 50149 (Why is no real title available?)
- scientific article; zbMATH DE number 591911 (Why is no real title available?)
- scientific article; zbMATH DE number 1042221 (Why is no real title available?)
- scientific article; zbMATH DE number 1927416 (Why is no real title available?)
- Are subsets necessary in Martin-Löf type theory?
- Functional reactive types
- Generic functional programming with types and relations
- Applications of type theory
- scientific article; zbMATH DE number 7552282 (Why is no real title available?)
- Dependent Types at Work
- Realist consequence, epistemic inference, computational correctness
- scientific article; zbMATH DE number 2238212 (Why is no real title available?)
- Folding left and right matters: Direct style, accumulators, and continuations
- Topological quantum gates in homotopy type theory
- The quantum monadology
- High-level modelling for typed functional programming
- Lyndon words formalized in Isabelle/HOL
- Probabilistic modelling, inference and learning using logical theories
- Innovations in computational type theory using Nuprl
- A mechanized proof of the basic perturbation lemma
- Formalizing non-interference for a simple bytecode language in Coq
- A computer-verified monadic functional implementation of the integral
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 Q4003339)
