5 Search Results for "Seisenberger, Monika"

Document
DOI: 10.4230/LIPIcs.CSL.2026.19
A Unifying Conservation Theorem

Authors: Giulio Fellin

Published in: LIPIcs, Volume 363, 34th EACSL Annual Conference on Computer Science Logic (CSL 2026)

Abstract
The relationship between classical and constructive logics has long been illuminated by a series of conservation results, beginning with Kolmogorov’s negative translation and Glivenko’s double negation theorem, and later extended by Kuroda and Segerberg to first-order and minimal logics respectively. These results reveal how certain classical principles can be interpreted or recovered within weaker constructive frameworks, either via translations or through minimal extensions that satisfy specific logical properties. In this paper, we propose a unifying generalisation of these conservation theorems, that consolidates and expands the abstract methods introduced in earlier studies, offering a unified perspective on the interplay between classical provability and constructive reasoning.
Cite as

Giulio Fellin. A Unifying Conservation Theorem. In 34th EACSL Annual Conference on Computer Science Logic (CSL 2026). Leibniz International Proceedings in Informatics (LIPIcs), Volume 363, pp. 19:1-19:23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2026)

Copy BibTex To Clipboard

@InProceedings{fellin:LIPIcs.CSL.2026.19,
  author =	{Fellin, Giulio},
  title =	{{A Unifying Conservation Theorem}},
  booktitle =	{34th EACSL Annual Conference on Computer Science Logic (CSL 2026)},
  pages =	{19:1--19:23},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-411-6},
  ISSN =	{1868-8969},
  year =	{2026},
  volume =	{363},
  editor =	{Guerrini, Stefano and K\"{o}nig, Barbara},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2026.19},
  URN =		{urn:nbn:de:0030-drops-254431},
  doi =		{10.4230/LIPIcs.CSL.2026.19},
  annote =	{Keywords: double negation, negative translation, conservation, minimal logic, Glivenko’s theorem}
}
Document
(Co)algebraic pearl
DOI: 10.4230/LIPIcs.CALCO.2025.16
Active Learning of Upward-Closed Sets of Words ((Co)algebraic pearl)

Authors: Quentin Aristote

Published in: LIPIcs, Volume 342, 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)

Abstract
We give a new proof of a result from well quasi-order theory on the computability of bases for upwards-closed sets of words. This new proof is based on Angluin’s L* algorithm, that learns an automaton from a minimally adequate teacher. This relates in particular two results from the 1980s: Angluin’s L* algorithm, and a result from Valk and Jantzen on the computability of bases for upwards-closed sets of tuples of integers. Along the way, we describe an algorithm for learning quasi-ordered automata from a minimally adequate teacher, and extend a generalization of Valk and Jantzen’s result, encompassing both words and integers, to finitely generated monoids.
Cite as

Quentin Aristote. Active Learning of Upward-Closed Sets of Words ((Co)algebraic pearl). In 11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 342, pp. 16:1-16:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{aristote:LIPIcs.CALCO.2025.16,
  author =	{Aristote, Quentin},
  title =	{{Active Learning of Upward-Closed Sets of Words}},
  booktitle =	{11th Conference on Algebra and Coalgebra in Computer Science (CALCO 2025)},
  pages =	{16:1--16:12},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-383-6},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{342},
  editor =	{C\^{i}rstea, Corina and Knapp, Alexander},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CALCO.2025.16},
  URN =		{urn:nbn:de:0030-drops-235751},
  doi =		{10.4230/LIPIcs.CALCO.2025.16},
  annote =	{Keywords: active learning, well quasi-orders, Valk-Jantzen lemma, piecewise-testable languages, monoids}
}
Document
DOI: 10.4230/LIPIcs.FSCD.2025.34
Monad Translations for Higher-Order Logic

Authors: Thomas Traversié

Published in: LIPIcs, Volume 337, 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)

Abstract
Classical logic can be embedded into intuitionistic logic by inserting double negations in formulas. Several translations generalize this idea by using monad operators instead of double negations. They eliminate particular axioms, for instance the principle of excluded middle or the principle of explosion, and therefore can be used to embed classical logic into intuitionistic logic or intuitionistic logic into minimal logic. Such translations have been defined for first-order logic. In this paper, we define a translation, parameterized by monad operators, for higher-order logic. In particular, the property that any formula and its translation are equivalent in the presence of the eliminated axiom holds under functional extensionality and propositional extensionality. We apply this translation to embed higher-order classical (respectively intuitionistic) logic into higher-order intuitionistic (respectively minimal) logic. By adapting Friedman’s trick, we show that coherent formulas correspond to a constructive fragment of higher-order classical logic, meaning that we can transform classical proofs into intuitionistic proofs without modifying the proven statements.
Cite as

Thomas Traversié. Monad Translations for Higher-Order Logic. In 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 337, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{traversie:LIPIcs.FSCD.2025.34,
  author =	{Traversi\'{e}, Thomas},
  title =	{{Monad Translations for Higher-Order Logic}},
  booktitle =	{10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025)},
  pages =	{34:1--34:14},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-374-4},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{337},
  editor =	{Fern\'{a}ndez, Maribel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2025.34},
  URN =		{urn:nbn:de:0030-drops-236495},
  doi =		{10.4230/LIPIcs.FSCD.2025.34},
  annote =	{Keywords: Higher-order logic, Intuitionistic logic, Kuroda’s translation, Monad}
}
Document
DOI: 10.4230/DagRep.6.1.69
Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031)

Authors: Jean Goubault-Larrecq, Monika Seisenberger, Victor Selivanov, and Andreas Weiermann

Published in: Dagstuhl Reports, Volume 6, Issue 1 (2016)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 16031 "Well Quasi-Orders in Computer Science", the first seminar devoted to the multiple and deep interactions between the theory of Well quasi-orders (known as the Wqo-Theory) and several fields of Computer Science (Verification and Termination of Infinite-State Systems, Automata and Formal Languages, Term Rewriting and Proof Theory, topological complexity of computational problems on continuous functions). Wqo-Theory is a highly developed part of Combinatorics with ever-growing number of applications in Mathematics and Computer Science, and Well quasi-orders are going to become an important unifying concept of Theoretical Computer Science. In this seminar, we brought together several communities from Computer Science and Mathematics in order to facilitate the knowledge transfer between Mathematicians and Computer Scientists as well as between established and younger researchers and thus to push forward the interaction between Wqo-Theory and Computer Science.
Cite as

Jean Goubault-Larrecq, Monika Seisenberger, Victor Selivanov, and Andreas Weiermann. Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031). In Dagstuhl Reports, Volume 6, Issue 1, pp. 69-98, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@Article{goubaultlarrecq_et_al:DagRep.6.1.69,
  author =	{Goubault-Larrecq, Jean and Seisenberger, Monika and Selivanov, Victor and Weiermann, Andreas},
  title =	{{Well Quasi-Orders in Computer Science (Dagstuhl Seminar 16031)}},
  pages =	{69--98},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2016},
  volume =	{6},
  number =	{1},
  editor =	{Goubault-Larrecq, Jean and Seisenberger, Monika and Selivanov, Victor and Weiermann, Andreas},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.1.69},
  URN =		{urn:nbn:de:0030-drops-58158},
  doi =		{10.4230/DagRep.6.1.69},
  annote =	{Keywords: Better quasi-order, Well quasi-order, Hierarchy, Infinite State Machines, Logic, Noetherian space, Reducibility, Termination, Topological Complexity,}
}
Document
DOI: 10.4230/LIPIcs.TYPES.2013.84
Extracting Imperative Programs from Proofs: In-place Quicksort

Authors: Ulrich Berger, Monika Seisenberger, and Gregory J. M. Woods

Published in: LIPIcs, Volume 26, 19th International Conference on Types for Proofs and Programs (TYPES 2013)

Abstract
The process of program extraction is primarily associated with functional programs with less focus on imperative program extraction. In this paper we consider a standard problem for imperative programming: In-place Quicksort. We formalize a proof that every array of natural numbers can be sorted and apply a realizability interpretation to extract a program from the proof. Using monads we are able to exhibit the inherent imperative nature of the extracted program. We see this as a first step towards an automated extraction of imperative programs. The case study is carried out in the interactive proof assistant Minlog.
Cite as

Ulrich Berger, Monika Seisenberger, and Gregory J. M. Woods. Extracting Imperative Programs from Proofs: In-place Quicksort. In 19th International Conference on Types for Proofs and Programs (TYPES 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 26, pp. 84-106, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2014)

Copy BibTex To Clipboard

@InProceedings{berger_et_al:LIPIcs.TYPES.2013.84,
  author =	{Berger, Ulrich and Seisenberger, Monika and Woods, Gregory J. M.},
  title =	{{Extracting Imperative Programs from Proofs: In-place Quicksort}},
  booktitle =	{19th International Conference on Types for Proofs and Programs (TYPES 2013)},
  pages =	{84--106},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-72-9},
  ISSN =	{1868-8969},
  year =	{2014},
  volume =	{26},
  editor =	{Matthes, Ralph and Schubert, Aleksy},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2013.84},
  URN =		{urn:nbn:de:0030-drops-46274},
  doi =		{10.4230/LIPIcs.TYPES.2013.84},
  annote =	{Keywords: Program Extraction, Verification, Realizability, Imperative Programs, In-Place Quicksort,Computational Monads, Minlog}
}
  • Refine by Type
  • 5 Document/PDF
  • 3 Document/HTML

  • Refine by Publication Year
  • 1 2026
  • 2 2025
  • 1 2016
  • 1 2014

  • Refine by Author
  • 2 Seisenberger, Monika
  • 1 Aristote, Quentin
  • 1 Berger, Ulrich
  • 1 Fellin, Giulio
  • 1 Goubault-Larrecq, Jean
  • Show More...

  • Refine by Series/Journal
  • 4 LIPIcs
  • 1 DagRep

  • Refine by Classification
  • 2 Theory of computation → Proof theory
  • 1 Theory of computation → Constructive mathematics
  • 1 Theory of computation → Formal languages and automata theory
  • 1 Theory of computation → Higher order logic

  • Refine by Keyword
  • 1 Better quasi-order
  • 1 Glivenko’s theorem
  • 1 Hierarchy
  • 1 Higher-order logic
  • 1 Imperative Programs
  • Show More...

Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2026 Schloss Dagstuhl – LZI GmbH Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact