×

Found 472 Documents (Results 1–100)

100
MathJax

Higher-order equational pattern anti-unification. (English) Zbl 1462.68092

Kirchner, Hélène (ed.), 3rd international conference on formal structures for computation and deduction, FSCD 2018, July 9–12, 2018, Oxford, United Kingdom. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 108, Article 12, 17 p. (2018).
MSC:  68Q42 03B40 68Q25
PDF BibTeX XML Cite
Full Text: DOI arXiv

\(\Pi\)-Ware: hardware description and verification in Agda. (English) Zbl 1433.68081

Uustalu, Tarmo (ed.), 21st international conference on types for proofs and programs, TYPES 2015, May 18–21, 2015, Tallinn, Estonia. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 69, Article 9, 27 p. (2018).
MSC:  68N15 68N18 94C11
PDF BibTeX XML Cite
Full Text: DOI

Fitch-style modal lambda calculi. (English) Zbl 06904540

Baier, Christel (ed.) et al., Foundations of software science and computation structures. 21st international conference, FOSSACS 2018, held as part of the European joint conferences on theory and practice of software, ETAPS 2018, Thessaloniki, Greece, April 14–20, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10803, 258-275 (2018).
MSC:  68Nxx 68Qxx
PDF BibTeX XML Cite
Full Text: DOI arXiv

Probabilistic reasoning about simply typed lambda terms. (English) Zbl 06856645

Artemov, Sergei (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2018, Deerfield Beach, FL, USA, January 8–11, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10703, 170-189 (2018).
MSC:  03B70
PDF BibTeX XML Cite
Full Text: DOI

On dinaturality, typability and \(\beta\eta\)-stable models. (English) Zbl 1434.03057

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 29, 17 p. (2017).
MSC:  03B40
PDF BibTeX XML Cite
Full Text: DOI

Deciding equivalence with sums and the empty type. (English) Zbl 1387.03014

Castagna, Giuseppe (ed.) et al., Proceedings of the 44th annual ACM SIGPLAN symposium on principles of programming languages, POPL ’17, Paris, France, January 15–21, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4660-3). 374-386 (2017).
MSC:  03B40 68Q60
PDF BibTeX XML Cite
Full Text: DOI arXiv

A hiking trip through the orders of magnitude: deriving efficient generators for closed simply-typed lambda terms and normal forms. (English) Zbl 1485.68044

Hermenegildo, Manuel V. (ed.) et al., Logic-based program synthesis and transformation. 26th international symposium, LOPSTR 2016, Edinburgh, UK, September 6–8, 2016. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10184, 240-255 (2017).
MSC:  68N18 68N17
PDF BibTeX XML Cite
Full Text: DOI arXiv

Models of \(\lambda\)-calculus and the weak MSO logic. (English) Zbl 1370.03022

Regnier, Laurent (ed.) et al., 25th EACSL annual conference and 30th workshop on computer science logic, CSL’16, Marseille, France, August 29 – September 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-022-4). LIPIcs – Leibniz International Proceedings in Informatics 62, Article 11, 12 p. (2016).
MSC:  03B40 03B15
PDF BibTeX XML Cite
Full Text: DOI

Compact bit encoding schemes for simply-typed lambda-terms. (English) Zbl 1361.68051

Garrigue, Jacques (ed.) et al., Proceedings of the 21st ACM SIGPLAN international conference on functional programming, ICFP ’16, Nara, Japan, September 18–22, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4219-3). 146-157 (2016).
MSC:  68N18 68P30 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Context update for lambdas and vectors. (English) Zbl 1485.03073

Amblard, Maxime (ed.) et al., Logical aspects of computational linguistics. Celebrating 20 years of LACL (1996–2016). 9th international conference, LACL 2016, Nancy, France, December 5–7, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 10054, 247-254 (2016).
MSC:  03B65 03B40
PDF BibTeX XML Cite
Full Text: DOI Link

A model for behavioural properties of higher-order programs. (English) Zbl 1373.68174

Kreutzer, Stephan (ed.), 24th EACSL annual conference and 29th workshop on computer science logic, CSL’15, Berlin, Germany, September 7–10, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-90-3). LIPIcs – Leibniz International Proceedings in Informatics 41, 229-243 (2015).
MSC:  68N18 03B70 68N30
PDF BibTeX XML Cite
Full Text: DOI

Ordered tree-pushdown systems. (English) Zbl 1366.68141

Harsha, Prahladh (ed.) et al., 35th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2015, Bangalore, India, December 16–18, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-97-2). LIPIcs – Leibniz International Proceedings in Informatics 45, 163-177 (2015).
MSC:  68Q45
PDF BibTeX XML Cite
Full Text: DOI arXiv

Which simple types have a unique inhabitant? (English) Zbl 1360.68341

Proceedings of the 20th ACM SIGPLAN international conference on functional programming, ICFP ’15, Vancouver, Canada, September 1–3, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3669-7). 243-255 (2015).
MSC:  68N18 68N30
PDF BibTeX XML Cite
Full Text: DOI Link

A type-theoretic approach to resolution. (English) Zbl 1362.68047

Falaschi, Moreno (ed.), Logic-based program synthesis and transformation. 25th international symposium, LOPSTR 2015, Siena, Italy, July 13–15, 2015. Revised selected papers. Cham: Springer (ISBN 978-3-319-27435-5/pbk; 978-3-319-27436-2/ebook). Lecture Notes in Computer Science 9527, 91-106 (2015).
PDF BibTeX XML Cite
Full Text: DOI arXiv

J-Calc: a typed lambda calculus for intuitionistic justification logic. (English) Zbl 1337.03023

de Paiva, Valeria (ed.) et al., Proceedings of the 6th workshop on intuitionistic modal logic and applications (IMLA 2013) in association with UNILOG 2013, Rio de Janeiro, Brazil, April 7, 2013. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 300, 71-87 (2014).
PDF BibTeX XML Cite
Full Text: DOI

Reflections on a theorem of Henkin. (English) Zbl 1330.03034

Manzano, María (ed.) et al., The life and work of Leon Henkin. Essays on his contributions. Cham: Birkhäuser/Springer (ISBN 978-3-319-09718-3/pbk; 978-3-319-09719-0/ebook). Studies in Universal Logic, 203-216 (2014).
MSC:  03B40
PDF BibTeX XML Cite
Full Text: DOI

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

Evaluation is MSOL-compatible. (English) Zbl 1359.03015

Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 103-114 (2013).
MSC:  03B40 03B15 03B25 68N18
PDF BibTeX XML Cite
Full Text: DOI

Semantic evaluation; intersection types and complexity of simply typed lambda calculus. (English) Zbl 1437.03054

Tiwari, Ashish (ed.), 23rd international conference on rewriting techniques and applications (RTA’12), Nagoya, Japan, May 28 – June 2, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 15, 323-338 (2012).
PDF BibTeX XML Cite
Full Text: DOI

Typed vs. untyped realizability. (English) Zbl 1342.68047

Berger, Ulrich (ed.) et al., Proceedings of the 28th conference on the mathematical foundations of programming semantics (MFPS XXVIII), Bath, UK, June 6–9, 2012. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 286, 57-71 (2012).
MSC:  68N18 68Q55
PDF BibTeX XML Cite
Full Text: DOI

Pure type systems with corecursion on streams, from finite to infinitary normalisation. (English) Zbl 1291.68131

Proceedings of the 17th ACM SIGPLAN international conference on functional programming, ICFP ’12, Copenhagen, Denmark, September 9–15, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1054-3). ACM SIGPLAN Notices 47, No. 9, 141-152 (2012).
MSC:  68N18 68Q65
PDF BibTeX XML Cite
Full Text: DOI

A type and effect system for determinism in multithreaded programs. (English) Zbl 1251.68074

Seidl, Helmut (ed.), Programming languages and systems. 21st European symposium on programming, ESOP 2012, held as part of the European joint conferences on theory and practice of software, ETAPS 2012, Tallinn, Estonia, March 24 – April 1, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28868-5/pbk). Lecture Notes in Computer Science 7211, 518-538 (2012).
MSC:  68N19 68N18 68Q55
PDF BibTeX XML Cite
Full Text: DOI

Relating two semantics of locally scoped names. (English) Zbl 1247.68046

Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12–15, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPIcs – Leibniz International Proceedings in Informatics 12, 396-411, electronic only (2011).
MSC:  68N18 68Q55
PDF BibTeX XML Cite
Full Text: DOI Link

Game semantics and uniqueness of type inhabitance in the simply-typed \(\lambda \)-calculus. (English) Zbl 1331.03018

Ong, Luke (ed.), Typed lambda calculi and applications. 10th international conference, TLCA 2011, Novi Sad, Serbia, June 1–3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21690-9/pbk; 978-3-642-21691-6/ebook). Lecture Notes in Computer Science 6690, 61-75 (2011).
MSC:  03B40
PDF BibTeX XML Cite
Full Text: DOI Link

Dependently-typed formalisation of relation-algebraic abstractions. (English) Zbl 1329.68063

de Swart, Harrie (ed.), Relational and algebraic methods in computer science. 12th international conference, RAMICS 2011, Rotterdam, The Netherlands, May 30 – June 3, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-21069-3/pbk). Lecture Notes in Computer Science 6663, 230-247 (2011).
MSC:  68N18 68N15 68Q65 68T15
PDF BibTeX XML Cite
Full Text: DOI

Type theory should eat itself. (English) Zbl 1337.68057

Abel, Andreas (ed.) et al., Proceedings of the 3rd international workshop on logical frameworks and metalanguages: theory and practice (LFMTP 2008), Pittsburgh, PA, USA, June 23, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 228, 21-36 (2009).
MSC:  68N18 68N15 68N30
PDF BibTeX XML Cite
Full Text: DOI

Some remarks on type systems for course-of-value recursion. (English) Zbl 1310.68055

Horizonte, Belo (ed.) et al., Proceedings of the 3rd workshop on logical and semantic frameworks, with applications (LSFA 2008), Salvador, Brazil, August 26, 2008. Amsterdam: Elsevier. Electronic Notes in Theoretical Computer Science 247, 103-121 (2009).
MSC:  68N18 68Q55 68Q65
PDF BibTeX XML Cite
Full Text: DOI

First-order universality for real programs. (English) Zbl 1268.03033

Ambos-Spies, Klaus (ed.) et al., Mathematical theory and computational practice. 5th conference on computability in Europe, CiE 2009, Heidelberg, Germany, July 19–24, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03072-7/pbk). Lecture Notes in Computer Science 5635, 1-10 (2009).
PDF BibTeX XML Cite
Full Text: DOI

Complexity of Gödel’s T in \(\lambda \)-formulation. (English) Zbl 1238.03024

Curien, Pierre-Louis (ed.), Typed lambda calculi and applications. 9th international conference, TLCA 2009, Brasilia, Brazil, July 1–3, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02272-2/pbk). Lecture Notes in Computer Science 5608, 386-400 (2009).
MSC:  03B40 68Q42
PDF BibTeX XML Cite
Full Text: DOI

Dependency tree automata. (English) Zbl 1234.03025

de Alfaro, Luca (ed.), Foundations of software science and computational structures. 12th international conference, FOSSACS 2009, held as part of the joint European conferences on theory and practice of software, ETAPS 2009, York, UK, March 22–29, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00595-4/pbk). Lecture Notes in Computer Science 5504, 92-106 (2009).
MSC:  03D05 03B40 68Q45
PDF BibTeX XML Cite
Full Text: DOI

Typed closure conversion preserves observational equivalence. (English) Zbl 1323.68350

Proceedings of the 13th ACM SIGPLAN international conference on functional programming, ICFP ’08, Victoria, BC, Canada, September 20–28, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-919-7). ACM SIGPLAN Notices 43, No. 9, 157-168 (2008).
PDF BibTeX XML Cite
Full Text: DOI Link

A type-preserving compiler in Haskell. (English) Zbl 1323.68187

Proceedings of the 13th ACM SIGPLAN international conference on functional programming, ICFP ’08, Victoria, BC, Canada, September 20–28, 2008. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-59593-919-7). ACM SIGPLAN Notices 43, No. 9, 75-86 (2008).
PDF BibTeX XML Cite
Full Text: DOI Link

A finite axiomatization of propositional type theory in pure lambda calculus. (English) Zbl 1226.03019

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, 243-258 (2008).
MSC:  03B15 03B40
PDF BibTeX XML Cite

\(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

On principal types of BCK-\(\lambda \)-terms. (English) Zbl 1213.03025

Leivant, Daniel (ed.) et al., Logic, language, information and computation. 14th international workshop, WoLLIC 2007, Rio de Janeiro, Brazil, July 2–5, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-73443-7/pbk). Lecture Notes in Computer Science 4576, 120-130 (2007).
MSC:  03B40 03B47
PDF BibTeX XML Cite
Full Text: DOI

Static typing for a faulty lambda calculus. (English) Zbl 1321.68109

Proceedings of the 11th ACM SIGPLAN international conference on functional programming, ICFP ’06, Portland, OR, USA, September 18–20, 2006. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-59593-309-3). ACM SIGPLAN Notices 41, No. 9, 38-49 (2006).
MSC:  68M15 68N18
PDF BibTeX XML Cite
Full Text: DOI

A game-theoretic approach to deciding higher-order matching. (English) Zbl 1133.03315

Bugliesi, Michele (ed.) et al., Automata, languages and programming. 33rd international colloquium, ICALP 2006, Venice, Italy, July 10–14, 2006. Proceedings, Part II. Berlin: Springer (ISBN 978-3-540-35907-4/pbk). Lecture Notes in Computer Science 4052, 348-359 (2006).
MSC:  03B25 03B40 91A80
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

Biographic Reference

all top 3

Software