Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Lambda-mu_calculus> ?p ?o }
Showing triples 1 to 43 of
43
with 100 triples per page.
- Lambda-mu_calculus abstract "In mathematical logic and computer science, the lambda-mu calculus is an extension of the lambda calculus introduced by M. Parigot. It introduces two new operators: the μ operator (which is completely different both from the μ operator found in computability theory and from the μ operator of modal μ-calculus) and the bracket operator. Proof-theoretically, it provides a well-behaved formulation of classical natural deduction. One of the main goals of this extended calculus is to be able to describe expressions corresponding to theorems in classical logic. According to the Curry–Howard isomorphism, lambda calculus on its own can express theorems in intuitionistic logic only, and several classical logical theorems can't be written at all. However with these new operators one is able to write terms that have the type of, for example, Peirce's law.Semantically these operators correspond to continuations, found in some functional programming languages.".
- Lambda-mu_calculus wikiPageExternalLink 811.
- Lambda-mu_calculus wikiPageID "13105770".
- Lambda-mu_calculus wikiPageLength "3629".
- Lambda-mu_calculus wikiPageOutDegree "20".
- Lambda-mu_calculus wikiPageRevisionID "707260035".
- Lambda-mu_calculus wikiPageWikiLink Category:Lambda_calculus.
- Lambda-mu_calculus wikiPageWikiLink Category:Proof_theory.
- Lambda-mu_calculus wikiPageWikiLink Classical_logic.
- Lambda-mu_calculus wikiPageWikiLink Computability_theory.
- Lambda-mu_calculus wikiPageWikiLink Computer_science.
- Lambda-mu_calculus wikiPageWikiLink Confluence_(abstract_rewriting).
- Lambda-mu_calculus wikiPageWikiLink Continuation.
- Lambda-mu_calculus wikiPageWikiLink Curry–Howard_correspondence.
- Lambda-mu_calculus wikiPageWikiLink Functional_programming.
- Lambda-mu_calculus wikiPageWikiLink Identifier.
- Lambda-mu_calculus wikiPageWikiLink Intuitionistic_logic.
- Lambda-mu_calculus wikiPageWikiLink Lambda_calculus.
- Lambda-mu_calculus wikiPageWikiLink Mathematical_logic.
- Lambda-mu_calculus wikiPageWikiLink Modal_μ-calculus.
- Lambda-mu_calculus wikiPageWikiLink Natural_deduction.
- Lambda-mu_calculus wikiPageWikiLink Peirces_law.
- Lambda-mu_calculus wikiPageWikiLink Proof_theory.
- Lambda-mu_calculus wikiPageWikiLink Pure_type_system.
- Lambda-mu_calculus wikiPageWikiLink Μ_operator.
- Lambda-mu_calculus wikiPageWikiLinkText "Lambda-mu calculus".
- Lambda-mu_calculus wikiPageWikiLinkText "λμ".
- Lambda-mu_calculus wikiPageWikiLinkText "λμ-calculus".
- Lambda-mu_calculus wikiPageUsesTemplate Template:Reflist.
- Lambda-mu_calculus subject Category:Lambda_calculus.
- Lambda-mu_calculus subject Category:Proof_theory.
- Lambda-mu_calculus hypernym Extension.
- Lambda-mu_calculus type Model.
- Lambda-mu_calculus type Software.
- Lambda-mu_calculus type Model.
- Lambda-mu_calculus type Proof.
- Lambda-mu_calculus comment "In mathematical logic and computer science, the lambda-mu calculus is an extension of the lambda calculus introduced by M. Parigot. It introduces two new operators: the μ operator (which is completely different both from the μ operator found in computability theory and from the μ operator of modal μ-calculus) and the bracket operator. Proof-theoretically, it provides a well-behaved formulation of classical natural deduction.".
- Lambda-mu_calculus label "Lambda-mu calculus".
- Lambda-mu_calculus sameAs Q6481090.
- Lambda-mu_calculus sameAs m.02z6pgq.
- Lambda-mu_calculus sameAs Q6481090.
- Lambda-mu_calculus wasDerivedFrom Lambda-mu_calculus?oldid=707260035.
- Lambda-mu_calculus isPrimaryTopicOf Lambda-mu_calculus.