Published in: LIPIcs, Volume 260, 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)
Pablo Barenbaum and Cristian Sottile. Two Decreasing Measures for Simply Typed λ-Terms. In 8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 260, pp. 11:1-11:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{barenbaum_et_al:LIPIcs.FSCD.2023.11, author = {Barenbaum, Pablo and Sottile, Cristian}, title = {{Two Decreasing Measures for Simply Typed \lambda-Terms}}, booktitle = {8th International Conference on Formal Structures for Computation and Deduction (FSCD 2023)}, pages = {11:1--11:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-277-8}, ISSN = {1868-8969}, year = {2023}, volume = {260}, editor = {Gaboardi, Marco and van Raamsdonk, Femke}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2023.11}, URN = {urn:nbn:de:0030-drops-179956}, doi = {10.4230/LIPIcs.FSCD.2023.11}, annote = {Keywords: Lambda Calculus, Rewriting, Termination, Strong Normalization, Simple Types} }
Published in: LIPIcs, Volume 252, 31st EACSL Annual Conference on Computer Science Logic (CSL 2023)
Pablo Barenbaum and Eduardo Bonelli. Reductions in Higher-Order Rewriting and Their Equivalence. In 31st EACSL Annual Conference on Computer Science Logic (CSL 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 252, pp. 8:1-8:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{barenbaum_et_al:LIPIcs.CSL.2023.8, author = {Barenbaum, Pablo and Bonelli, Eduardo}, title = {{Reductions in Higher-Order Rewriting and Their Equivalence}}, booktitle = {31st EACSL Annual Conference on Computer Science Logic (CSL 2023)}, pages = {8:1--8:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-264-8}, ISSN = {1868-8969}, year = {2023}, volume = {252}, editor = {Klin, Bartek and Pimentel, Elaine}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2023.8}, URN = {urn:nbn:de:0030-drops-174694}, doi = {10.4230/LIPIcs.CSL.2023.8}, annote = {Keywords: Term Rewriting, Higher-Order Rewriting, Proof terms, Equivalence of Computations} }
Published in: LIPIcs, Volume 152, 28th EACSL Annual Conference on Computer Science Logic (CSL 2020)
Delia Kesner, Eduardo Bonelli, and Andrés Viso. Strong Bisimulation for Control Operators (Invited Talk). In 28th EACSL Annual Conference on Computer Science Logic (CSL 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 152, pp. 4:1-4:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{kesner_et_al:LIPIcs.CSL.2020.4, author = {Kesner, Delia and Bonelli, Eduardo and Viso, Andr\'{e}s}, title = {{Strong Bisimulation for Control Operators}}, booktitle = {28th EACSL Annual Conference on Computer Science Logic (CSL 2020)}, pages = {4:1--4:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-132-0}, ISSN = {1868-8969}, year = {2020}, volume = {152}, editor = {Fern\'{a}ndez, Maribel and Muscholl, Anca}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2020.4}, URN = {urn:nbn:de:0030-drops-116473}, doi = {10.4230/LIPIcs.CSL.2020.4}, annote = {Keywords: Lambda-mu calculus, proof-nets, strong bisimulation} }
Published in: LIPIcs, Volume 69, 21st International Conference on Types for Proofs and Programs (TYPES 2015) (2018)
Juan Edi, Andrés Viso, and Eduardo Bonelli. Efficient Type Checking for Path Polymorphism. In 21st International Conference on Types for Proofs and Programs (TYPES 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 69, pp. 6:1-6:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{edi_et_al:LIPIcs.TYPES.2015.6, author = {Edi, Juan and Viso, Andr\'{e}s and Bonelli, Eduardo}, title = {{Efficient Type Checking for Path Polymorphism}}, booktitle = {21st International Conference on Types for Proofs and Programs (TYPES 2015)}, pages = {6:1--6:23}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-030-9}, ISSN = {1868-8969}, year = {2018}, volume = {69}, editor = {Uustalu, Tarmo}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2015.6}, URN = {urn:nbn:de:0030-drops-84761}, doi = {10.4230/LIPIcs.TYPES.2015.6}, annote = {Keywords: lambda-calculus, pattern matching, path polymorphism, type checking} }
Published in: LIPIcs, Volume 84, 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)
Pablo Barenbaum and Eduardo Bonelli. Optimality and the Linear Substitution Calculus. In 2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 84, pp. 9:1-9:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
@InProceedings{barenbaum_et_al:LIPIcs.FSCD.2017.9, author = {Barenbaum, Pablo and Bonelli, Eduardo}, title = {{Optimality and the Linear Substitution Calculus}}, booktitle = {2nd International Conference on Formal Structures for Computation and Deduction (FSCD 2017)}, pages = {9:1--9:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-047-7}, ISSN = {1868-8969}, year = {2017}, volume = {84}, editor = {Miller, Dale}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2017.9}, URN = {urn:nbn:de:0030-drops-77307}, doi = {10.4230/LIPIcs.FSCD.2017.9}, annote = {Keywords: Rewriting, Lambda Calculus, Explicit Substitutions, Optimal Reduction} }
Published in: LIPIcs, Volume 15, 23rd International Conference on Rewriting Techniques and Applications (RTA'12) (2012)
Eduardo Bonelli, Delia Kesner, Carlos Lombardi, and Alejandro Rios. Normalisation for Dynamic Pattern Calculi. In 23rd International Conference on Rewriting Techniques and Applications (RTA'12). Leibniz International Proceedings in Informatics (LIPIcs), Volume 15, pp. 117-132, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)
@InProceedings{bonelli_et_al:LIPIcs.RTA.2012.117, author = {Bonelli, Eduardo and Kesner, Delia and Lombardi, Carlos and Rios, Alejandro}, title = {{Normalisation for Dynamic Pattern Calculi}}, booktitle = {23rd International Conference on Rewriting Techniques and Applications (RTA'12)}, pages = {117--132}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-38-5}, ISSN = {1868-8969}, year = {2012}, volume = {15}, editor = {Tiwari, Ashish}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2012.117}, URN = {urn:nbn:de:0030-drops-34889}, doi = {10.4230/LIPIcs.RTA.2012.117}, annote = {Keywords: Pattern calculi, reduction strategies, sequentiality, neededness} }
Feedback for Dagstuhl Publishing