×

Found 311 Documents (Results 1–100)

100
MathJax

Reliability analysis of cutting system of sugar industry using intuitionistic fuzzy Lambda-Tau approach. (English) Zbl 1469.90064

Kumar, Amit (ed.) et al., The handbook of reliability, maintenance, and system safety through mathematical modeling. Amsterdam: Elsevier/Academic Press. 65-77 (2021).
MSC:  90B25
PDF BibTeX XML Cite
Full Text: DOI

Superposition with lambdas. (English) Zbl 1471.03014

Fontaine, Pascal (ed.), Automated deduction – CADE 27. 27th international conference on automated deduction, Natal, Brazil, August 27–30, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11716, 55-73 (2019).
PDF BibTeX XML Cite
Full Text: DOI arXiv Link

Machine-checked proof of the Church-Rosser theorem for the lambda calculus using the Barendregt variable convention in constructive type theory. (English) Zbl 1433.68542

Alves, Sandra (ed.) et al., Selected papers of the 12th workshop on logical and semantic frameworks, with applications (LSFA 2017), Brasilia, Brazil, September 23–24, 2017. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 338, 79-95 (2018).
PDF BibTeX XML Cite
Full Text: DOI

Relating system F and \(\lambda 2\): a case study in Coq, Abella and Beluga. (English) Zbl 1434.03030

Miller, Dale (ed.), 2nd international conference on formal structures for computation and deduction. FSCD 2017, Oxford, UK, September 3–9, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 84, Article 21, 19 p. (2017).
MSC:  03B35 03B38 03B40
PDF BibTeX XML Cite
Full Text: DOI

qPCF: a language for quantum circuit computations. (English) Zbl 1462.81061

Gopal, T. V. (ed.) et al., Theory and applications of models of computation. 14th annual conference, TAMC 2017, Bern, Switzerland, April 20–22, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10185, 455-469 (2017).
PDF BibTeX XML Cite
Full Text: DOI

Canonical HybridLF: extending Hybrid with dependent types. (English) Zbl 1394.68351

Benevides, Mario (ed.) et al., Proceedings of the 10th workshop on logical and semantic frameworks, with applications (LSFA 2015), Natal, Brazil, August 31 – September 1, 2015. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 323, 125-142 (2016).
MSC:  68T15 03B35 03B40
PDF BibTeX XML Cite
Full Text: DOI

Automath type inclusion in Barendregt’s cube. (English) Zbl 1466.68078

Beklemishev, Lev D. (ed.) et al., Computer science – theory and applications. 10th international computer science symposium in Russia, CSR 2015, Listvyanka, Russia, July 13–17, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9139, 262-282 (2015).
PDF BibTeX XML Cite
Full Text: DOI

Computation, proof, machine. Mathematics enters a new age. Translated from the French by Pierre Guillot and Marion Roman. (English) Zbl 1318.01002

Cambridge: Cambridge University Press (ISBN 978-0-521-13377-7/pbk; 978-0-521-11801-9/hbk). viii, 152 p. (2015).
PDF BibTeX XML Cite

Type theories from Barendregt’s cube for theorem provers. (English) Zbl 1344.03015

Pereira, Luiz Carlos (ed.) et al., Advances in natural deduction. A celebration of Dag Prawitz’s work. Selected papers based on the presentations at the conference “Natural deduction”, Rio de Janeiro, Brazil, 2001. Dordrecht: Springer (ISBN 978-94-007-7547-3/hbk; 978-94-007-7548-0/ebook). Trends in Logic – Studia Logica Library 39, 129-144 (2014).
MSC:  03B35 03B40
PDF BibTeX XML Cite
Full Text: DOI

Measurements in proof nets as higher-order quantum circuits. (English) Zbl 1405.68095

Shao, Zhong (ed.), Programming languages and systems. 23rd European symposium on programming, ESOP 2014, held as part of the European joint conferences on theory and practice of software, ETAPS 2014, Grenoble, France, April 5–13, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54832-1/pbk). Lecture Notes in Computer Science 8410, 371-391 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Polymorphic logic. (English) Zbl 1315.03043

Berger, Ulrich (ed.) et al., Logic, construction, computation. Dedicated to the 70th birthday of Helmut Schwichtenberg. Frankfurt am Main: Ontos Verlag; Berlin: De Gruyter (ISBN 978-3-11-032453-2/hbk; 978-3-86838-158-0/hbk; 978-3-11-032492-1/ebook). Ontos Mathematical Logic 3, 51-65 (2012).
MSC:  03B70 03B15 03B35 03B40
PDF BibTeX XML Cite

A theory independent Curry-De Bruijn-Howard correspondence. (English) Zbl 1367.03029

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Coventry, UK, July 9–13, 2012. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-31584-8/pbk). Lecture Notes in Computer Science 7392, 13-15 (2012).
MSC:  03B40 03B35 03F03
PDF BibTeX XML Cite
Full Text: DOI

Computing in Cantor’s paradise with \(\lambda_{\mathrm{ZFC}}\). (English) Zbl 1354.03010

Schrijvers, Tom (ed.) et al., Functional and logic programming. 11th international symposium, FLOPS 2012, Kobe, Japan, May 23–25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29821-9/pbk). Lecture Notes in Computer Science 7294, 290-306 (2012).
MSC:  03B40 03B35 03E30 68T15
PDF BibTeX XML Cite
Full Text: DOI

The metamorphoses of the calculus. An amazing history of mathematics. Reprint of the 2007 edition. (Les métamorphoses du calcul. Une étonnante histoire de mathématiques.) (French) Zbl 1360.01012

Poche. Paris: Éditions Le Pommier (ISBN 978-2-7465-0561-2/pbk). 224 p. (2011).
PDF BibTeX XML Cite

Proofs and algorithms. An introduction to logic and computability. (English) Zbl 1230.03001

Undergraduate Topics in Computer Science. New York, NY: Springer (ISBN 978-0-85729-120-2/pbk; 978-0-85729-121-9/ebook). xii, 155 p. (2011).
PDF BibTeX XML Cite
Full Text: DOI

An efficient nominal unification algorithm. (English) Zbl 1236.68138

Lynch, Christopher (ed.), Proceedings of the 21st international conference on rewriting techniques and applications (RTA 2010), July 11–13, 2010, Edinburgh, Scottland, UK. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-18-7). LIPIcs – Leibniz International Proceedings in Informatics 6, 209-226, electronic only (2010).
MSC:  68Q42 03B40 03B35
PDF BibTeX XML Cite
Full Text: DOI Link

Proofs and algorithms. An introduction to logic and computability. (Les démonstrations et les algorithmes. Introduction à la logique et à la calculabilité.) (French) Zbl 1230.03002

Palaiseau: Les Éditions de l’École Polytechnique (ISBN 978-2-7302-1569-5). 195 p. (2010).
PDF BibTeX XML Cite

On arithmetic computations with hereditarily finite sets, functions and types. (English) Zbl 1286.68063

Cavalcanti, Ana (ed.) et al., Theoretical aspects of computing – ICTAC 2010. 7th international colloquium, Natal, Rio Grande do Norte, Brazil, September 1–3, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-14807-1/pbk). Lecture Notes in Computer Science 6255, 367-381 (2010).
MSC:  68N18
PDF BibTeX XML Cite
Full Text: DOI

HTab: a terminating tableaux system for hybrid logic. (English) Zbl 1347.68301

Areces, Carlos (ed.) et al., Proceedings of the 5th workshop on methods for modalities (M4M5 2007), Cachan, France, November 29–30, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 231, 3-19 (2009).
MSC:  68T15 03B35 03B45 03B62 68N18 68T27
PDF BibTeX XML Cite
Full Text: DOI

Higher-order proof construction based on first-order narrowing. (English) Zbl 1278.03059

Pientka, B. (ed.) et al., Proceedings of the second international workshop on logical frameworks and meta-languages: theory and practice (LFMTP 2007), Bremen, Germany, July 15, 2007. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 196, 69-84 (2008).
MSC:  03B70 03B15 03B35 68N18 68T15
PDF BibTeX XML Cite
Full Text: Link

\(M\)-set models. (English) Zbl 1226.03014

Benzmüller, Christoph (ed.) et al., Reasoning in simple type theory. Festschrift in honor of Peter B. Andrews on his 70th birthday. London: College Publications (ISBN 978-1-904987-70-3/pbk). Studies in Logic (London) 17. Mathematical Logic and Foundations, 149-172 (2008).
MSC:  03B15 03B35 03B40
PDF BibTeX XML Cite

Reasoning in simple type theory. Festschrift in honor of Peter B. Andrews on his 70th birthday. (English) Zbl 1196.03002

Studies in Logic (London) 17. Mathematical Logic and Foundations. London: College Publications (ISBN 978-1-904987-70-3/pbk). 467 p. (2008).
MSC:  03-06 00B30 01A60 01A70 03-03 03B15 03B35 03B40 03F05 68T15
PDF BibTeX XML Cite

Proofs verifying programs and programs producing proofs: a conceptual analysis. (English) Zbl 1193.03008

Lupacchini, Rossella (ed.) et al., Deduction, computation, experiment. Exploring the effectiveness of proof. Including papers from the workshop held at the University of Bologna, Bologna, Italy, April 3–4, 2007. Berlin: Springer (ISBN 978-88-470-0783-3/pbk). 81-94 (2008).
MSC:  03A05 00A30 00A35 03B35 03B40 68Q60 68T15
PDF BibTeX XML Cite
Full Text: DOI

Computation by prophecy. (English) Zbl 1215.03047

Ronchi della Rocca, Simona (ed.), Typed lambda calculi and applications. 8th international conference, TLCA 2007, Paris, France, June 26–28, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73227-3/pbk). Lecture Notes in Computer Science 4583, 70-83 (2007).
PDF BibTeX XML Cite
Full Text: DOI

Barendregt’s variable convention in rule inductions. (English) Zbl 1213.03024

Pfenning, Frank (ed.), Automated deduction – CADE-21. 21st international conference on automated deduction, Bremen, Germany, July 17–20, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73594-6/pbk). Lecture Notes in Computer Science 4603. Lecture Notes in Artificial Intelligence, 35-50 (2007).
MSC:  03B35 03B40 68Q60
PDF BibTeX XML Cite
Full Text: DOI

Building decision procedures in the calculus of inductive constructions. (English) Zbl 1179.68135

Duparc, Jacques (ed.) et al., Computer science logic. 21st international workshop, CSL 2007, 16th annual conference of the EACSL, Lausanne, Switzerland, September 11–15, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74914-1/pbk). Lecture Notes in Computer Science 4646, 328-342 (2007).
MSC:  68T15 03B35 03B40
PDF BibTeX XML Cite
Full Text: DOI arXiv

The metamorphoses of the calculus. An amazing history of mathematics. (Les métamorphoses du calcul. Une étonnante histoire de mathématiques.) (French) Zbl 1161.01001

Paris: Éditions Le Pommier (ISBN 978-2-7465-0324-3/pbk). 224 p. (2007).
PDF BibTeX XML Cite

Coinductive field of exact real numbers and general corecursion. (English) Zbl 1276.03014

Ghani, Neil (ed.) et al., Proceedings of the eighth workshop on coalgebraic methods in computer science (CMCS 2006), Vienna, Austria, March 25–27, 2006. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 164, No. 1, 121-139 (2006).
MSC:  03B35 03B40 03D78 68N18 68T15
PDF BibTeX XML Cite
Full Text: Link

CIC\(\widehat{~}\): Type-based termination of recursive definitions in the calculus of inductive constructions. (English) Zbl 1165.03322

Hermann, Miki (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 13th international conference, LPAR 2006, Phnom Penh, Cambodia, November 13–17, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-48281-9/pbk). Lecture Notes in Computer Science 4246. Lecture Notes in Artificial Intelligence, 257-271 (2006).
MSC:  03B40 03B35 68T15
PDF BibTeX XML Cite
Full Text: DOI

Matching modulo superdevelopments application to second-order matching. (English) Zbl 1165.03323

Hermann, Miki (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 13th international conference, LPAR 2006, Phnom Penh, Cambodia, November 13–17, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-48281-9/pbk). Lecture Notes in Computer Science 4246. Lecture Notes in Artificial Intelligence, 60-74 (2006).
MSC:  03B40 03B35 68Q42
PDF BibTeX XML Cite
Full Text: DOI Link

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software