Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)
Andrej Dudenhefner and Daniele Pautasso. Mechanized Subject Expansion in Uniform Intersection Types for Perpetual Reductions. In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 8:1-8:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{dudenhefner_et_al:LIPIcs.FSCD.2024.8, author = {Dudenhefner, Andrej and Pautasso, Daniele}, title = {{Mechanized Subject Expansion in Uniform Intersection Types for Perpetual Reductions}}, booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)}, pages = {8:1--8:20}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-323-2}, ISSN = {1868-8969}, year = {2024}, volume = {299}, editor = {Rehof, Jakob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.8}, URN = {urn:nbn:de:0030-drops-203371}, doi = {10.4230/LIPIcs.FSCD.2024.8}, annote = {Keywords: lambda-calculus, simple types, intersection types, strong normalization, mechanization, perpetual reductions} }
Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)
Franz Baader and Jürgen Giesl. On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems. In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 16:1-16:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{baader_et_al:LIPIcs.FSCD.2024.16, author = {Baader, Franz and Giesl, J\"{u}rgen}, title = {{On the Complexity of the Small Term Reachability Problem for Terminating Term Rewriting Systems}}, booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)}, pages = {16:1--16:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-323-2}, ISSN = {1868-8969}, year = {2024}, volume = {299}, editor = {Rehof, Jakob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.16}, URN = {urn:nbn:de:0030-drops-203454}, doi = {10.4230/LIPIcs.FSCD.2024.16}, annote = {Keywords: Rewriting, Termination, Confluence, Creating small terms, Derivational complexity, Description Logics, Proof rewriting} }
Published in: LIPIcs, Volume 299, 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)
Salvador Lucas. Termination of Generalized Term Rewriting Systems. In 9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 299, pp. 32:1-32:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024)
@InProceedings{lucas:LIPIcs.FSCD.2024.32, author = {Lucas, Salvador}, title = {{Termination of Generalized Term Rewriting Systems}}, booktitle = {9th International Conference on Formal Structures for Computation and Deduction (FSCD 2024)}, pages = {32:1--32:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-323-2}, ISSN = {1868-8969}, year = {2024}, volume = {299}, editor = {Rehof, Jakob}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2024.32}, URN = {urn:nbn:de:0030-drops-203616}, doi = {10.4230/LIPIcs.FSCD.2024.32}, annote = {Keywords: Program Analysis, Reduction-Based Systems, Termination} }
Published in: LIPIcs, Volume 23, Computer Science Logic 2013 (CSL 2013)
Nachum Dershowitz. Res Publica: The Universal Model of Computation (Invited Talk). In Computer Science Logic 2013 (CSL 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 23, pp. 5-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
@InProceedings{dershowitz:LIPIcs.CSL.2013.5, author = {Dershowitz, Nachum}, title = {{Res Publica: The Universal Model of Computation}}, booktitle = {Computer Science Logic 2013 (CSL 2013)}, pages = {5--10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-60-6}, ISSN = {1868-8969}, year = {2013}, volume = {23}, editor = {Ronchi Della Rocca, Simona}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2013.5}, URN = {urn:nbn:de:0030-drops-41844}, doi = {10.4230/LIPIcs.CSL.2013.5}, annote = {Keywords: Models of computation, cellular automata, abstract state machines, causal dynamics, interaction} }