×

Found 216 Documents (Results 1–100)

A strong call-by-need calculus. (English) Zbl 07700614

Kobayashi, Naoki (ed.), 6th international conference on formal structures for computation and deduction, FSCD 2021, Buenos Aires, Argentina, virtual conference, July 17–24, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 195, Article 9, 22 p. (2021).
MSC:  68-XX 03B70 68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

The call-by-value \(\lambda\)-calculus with generalized applications. (English) Zbl 07650848

Fernández, Maribel (ed.) et al., 28th EACSL annual conference on computer science logic, CSL 2020, Barcelona, Spain, January 13–16, 2020. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 152, Article 35, 12 p. (2020).
MSC:  68-XX 03B70
PDFBibTeX XMLCite
Full Text: DOI

The confluent terminating context-free substitutive rewriting system for the lambda-calculus with surjective pairing and terminal type. (English) Zbl 1434.68213

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 6, 19 p. (2017).
MSC:  68Q42 03B40
PDFBibTeX XMLCite
Full Text: DOI

Strongly normalizing audited computation. (English) Zbl 1434.03059

Goranko, Valentin (ed.) et al., 26th EACSL annual conference on computer science logic, CSL 2017, Stockholm, Sweden, August 20–24, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 82, Article 36, 21 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Strong normalization through intersection types and memory. (English) Zbl 1394.03023

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, 75-91 (2016).
MSC:  03B40 03F05
PDFBibTeX XMLCite
Full Text: DOI

Strong normalization for the parameter-free polymorphic lambda calculus based on the \(\Omega\)-rule. (English) Zbl 1387.03010

Kesner, Delia (ed.) et al., 1st international conference on formal structures for computation and deduction, FSCD 2016, Porto, Portugal, June 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-010-1). LIPIcs – Leibniz International Proceedings in Informatics 52, Article 5, 15 p. (2016).
MSC:  03B40
PDFBibTeX XMLCite
Full Text: DOI

Head reduction and normalization in a call-by-value lambda-calculus. (English) Zbl 1428.68100

Chiba, Yuki (ed.) et al., Second international workshop on rewriting techniques for program transformations and evaluation, WPTE’15, Warsaw, Poland, July 2, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. OASIcs – OpenAccess Ser. Inform. 46, 3-17 (2015).
MSC:  68N18
PDFBibTeX XMLCite
Full Text: DOI

Termination of dependently typed rewrite rules. (English) Zbl 1367.68140

Altenkirch, Thorsten (ed.), 13th international conference on typed lambda calculi and applications, TLCA’15, Warsaw, Poland, July 1–3, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-87-3). LIPIcs – Leibniz International Proceedings in Informatics 38, 257-272 (2015).
MSC:  68Q42 68N18
PDFBibTeX XMLCite
Full Text: DOI

Structures for structural recursion. (English) Zbl 1360.68361

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). 127-139 (2015).
MSC:  68N30 03B70 68N18
PDFBibTeX XMLCite
Full Text: DOI

Type-based productivity of stream definitions in the calculus of constructions. (English) Zbl 1366.68254

Proceedings of the 2013 28th annual ACM/IEEE symposium on logic in computer science, LICS 2013, Tulane University, New Orleans, LA, USA, June 25–28, 2013. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-5020-6). 233-242 (2013).
MSC:  68T15 03B70
PDFBibTeX XMLCite
Full Text: DOI

Semantics of intensional type theory extended with decidable equational theories. (English) Zbl 1356.68205

Ronchi della Rocca, Simona (ed.), Computer science logic 2013. Selected papers of the 27th CSL workshop and 22nd annual conference of the European Association for Computer Science Logic (EACSL), Torino, Italy, September 2–5, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-60-6). LIPIcs – Leibniz International Proceedings in Informatics 23, 653-667 (2013).
MSC:  68T15 03B35
PDFBibTeX XMLCite
Full Text: DOI

Wellfounded recursion with copatterns: a unified approach to termination and productivity. (English) Zbl 1323.68087

Proceedings of the 18th ACM SIGPLAN international conference on functional programming, ICFP ’13, Boston, MA, USA, September 25–27, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2326-0). ACM SIGPLAN Notices 48, No. 9, 185-196 (2013).
MSC:  68N18 03B70 68P05
PDFBibTeX XMLCite
Full Text: DOI

System \(\mathrm F _{i }\). A higher-order polymorphic \(\lambda \)-calculus with erasable term-indices. (English) Zbl 1381.68044

Hasegawa, Masahito (ed.), Typed lambda calculi and applications. 11th international conference, TLCA 2013, Eindhoven, The Netherlands, June 26–28, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38945-0/pbk). Lecture Notes in Computer Science 7941, 15-30 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Mendler-style iso-(co)inductive predicates: a strongly normalizing approach. (English) Zbl 1458.68039

Ronchi Della Rocca, Simona (ed.) et al., Proceedings of the 6th workshop on logical and semantic frameworks, with applications, Belo Horizonte, Brazil, August 27, 2011. Waterloo: Open Publishing Association (OPA). Electron. Proc. Theor. Comput. Sci. (EPTCS) 81, 30-46 (2012).
MSC:  68N30 03B16 03B70
PDFBibTeX XMLCite
Full Text: arXiv Link

Linear logic and strong normalization. (English) Zbl 1356.03102

van Raamsdonk, Femke (ed.), 24th international conference on rewriting techniques and applications (RTA 2013), Eindhoven, The Netherlands, June 24–26, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-53-8). LIPIcs – Leibniz International Proceedings in Informatics 21, 39-54 (2013).
PDFBibTeX XMLCite
Full Text: DOI

Harnessing \(\mathrm{ML}^{\mathrm F}\) with the power of system F. (English) Zbl 1287.68022

Hliněný, Petr (ed.) et al., Mathematical foundations of computer science 2010. 35th international symposium, MFCS 2010, Brno, Czech Republic, August 23–27, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-15154-5/pbk). Lecture Notes in Computer Science 6281, 525-536 (2010).
MSC:  68N18 03F52
PDFBibTeX XMLCite
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
PDFBibTeX XMLCite
Full Text: DOI

Short proofs of strong normalization. (English) Zbl 1173.03303

Ochmański, Edward (ed.) et al., Mathematical foundations of computer science 2008. 33rd international symposium, MFCS 2008, Toruń Poland, August 25–29, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85237-7/pbk). Lecture Notes in Computer Science 5162, 613-623 (2008).
MSC:  03B40 03F05 03F20
PDFBibTeX XMLCite
Full Text: DOI arXiv

On the relations between the syntactic theories of \(\lambda \mu \)-calculi. (English) Zbl 1156.03317

Kaminski, Michael (ed.) et al., Computer science logic. 22nd international workshop, CSL 2008, 17th annual conference of the EACSL, Bertinoro, Italy, September 16–19, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-87530-7/pbk). Lecture Notes in Computer Science 5213, 154-168 (2008).
MSC:  03B40 03B70 68N18
PDFBibTeX XMLCite
Full Text: DOI

A note on rewriting proofs and Fibonacci numbers. (English) Zbl 1133.05006

Artemov, Sergei N. (ed.) et al., Logical foundations of computer science. International symposium, LFCS 2007, New York, NY, USA, June 4–7, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72732-3/pbk). Lecture Notes in Computer Science 4514, 284-292 (2007).
MSC:  05A17 05A20 68Q42 68T15
PDFBibTeX XMLCite
Full Text: DOI

Stabilization – an alternative to double-negation translation for classical natural deduction. (English) Zbl 1102.03008

Stoltenberg-Hansen, Viggo (ed.) et al., Logic colloquium ’03. Proceedings of the annual European summer meeting of the Association for Symbolic Logic (ASL), Helsinki, Finland, August 14–20, 2003. Wellesley, MA: A K Peters; Urbana, IL: Association for Symbolic Logic (ASL) (ISBN 1-56881-293-0/hbk; 1-56881-294-9/pbk). Lecture Notes in Logic 24, 167-199 (2006).
MSC:  03B40 03F05
PDFBibTeX XMLCite

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software