55 lines
3.1 KiB
BibTeX
55 lines
3.1 KiB
BibTeX
@InProceedings{Fiore2008,
|
||
|
||
author={Fiore, Marcelo},
|
||
|
||
booktitle={2008 23rd Annual IEEE Symposium on Logic in Computer Science},
|
||
|
||
title={Second-Order and Dependently-Sorted Abstract Syntax},
|
||
|
||
year={2008},
|
||
|
||
volume={},
|
||
|
||
number={},
|
||
|
||
pages={57-68},
|
||
|
||
keywords={Algebra;Computer science;Mathematical model;Logic functions;Laboratories;MONOS devices;Sorting;abstract syntax;second-order syntax;dependently-sorted syntax;alpha-equivalence;variable binding;substitution;metavariable;meta-substitution;categorical algebra},
|
||
|
||
doi={10.1109/LICS.2008.38}
|
||
}
|
||
|
||
@InProceedings{Altenkirch2018,
|
||
author={"Altenkirch, Thorsten and Capriotti, Paolo and Dijkstra, Gabe and Kraus, Nicolai and Nordvall Forsberg, Fredrik"},
|
||
editor={"Baier, Christel and Dal Lago, Ugo"},
|
||
title={"Quotient Inductive-Inductive Types"},
|
||
booktitle={"Foundations of Software Science and Computation Structures"},
|
||
year={"2018"},
|
||
publisher={"Springer International Publishing"},
|
||
address={"Cham"},
|
||
pages={"293--310"},
|
||
abstract={"Higher inductive types (HITs) in Homotopy Type Theory allow the definition of datatypes which have constructors for equalities over the defined type. HITs generalise quotient types, and allow to define types with non-trivial higher equality types, such as spheres, suspensions and the torus. However, there are also interesting uses of HITs to define types satisfying uniqueness of equality proofs, such as the Cauchy reals, the partiality monad, and the well-typed syntax of type theory. In each of these examples we define several types that depend on each other mutually, i.e. they are inductive-inductive definitions. We call those HITs quotient inductive-inductive types (QIITs). Although there has been recent progress on a general theory of HITs, there is not yet a theoretical foundation for the combination of equality constructors and induction-induction, despite many interesting applications. In the present paper we present a first step towards a semantic definition of QIITs. In particular, we give an initial-algebra semantics. We further derive a section induction principle, stating that every algebra morphism into the algebra in question has a section, which is close to the intuitively expected elimination rules."},
|
||
isbn={"978-3-319-89366-2"}
|
||
}
|
||
|
||
@InProceedings{Munchhausen,
|
||
author = {Altenkirch, Thorsten and Kaposi, Ambrus and \v{S}inkarovs, Artjoms and V\'{e}gh, Tam\'{a}s},
|
||
title = {{The M\"{u}nchhausen Method in Type Theory}},
|
||
booktitle = {28th International Conference on Types for Proofs and Programs (TYPES 2022)},
|
||
pages = {10:1--10:20},
|
||
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
|
||
ISBN = {978-3-95977-285-3},
|
||
ISSN = {1868-8969},
|
||
year = {2023},
|
||
volume = {269},
|
||
editor = {Kesner, Delia and P\'{e}drot, Pierre-Marie},
|
||
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
|
||
address = {Dagstuhl, Germany},
|
||
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.TYPES.2022.10},
|
||
URN = {urn:nbn:de:0030-drops-184534},
|
||
doi = {10.4230/LIPIcs.TYPES.2022.10},
|
||
annote = {Keywords: type theory, proof assistants, very dependent types}
|
||
}
|
||
|
||
|