default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAmbrus Kaposi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Thorsten Altenkirch
, Yorgo Chamoun, Ambrus Kaposi, Michael Shulman:
Internal Parametricity, without an Interval. Proc. ACM Program. Lang. 8(POPL): 2340-2369 (2024)- [c17]Ambrus Kaposi, Szumi Xie:
Second-Order Generalised Algebraic Theories: Signatures and First-Order Semantics. FSCD 2024: 10:1-10:24 - 2023
- [c16]Rafaël Bocquet, Ambrus Kaposi, Christian Sattler:
For the Metatheory of Type Theory, Internal Sconing Is Enough. FSCD 2023: 18:1-18:23 - [c15]Thorsten Altenkirch, Ambrus Kaposi, Artjoms Sinkarovs, Tamás Végh:
Combinatory Logic and Lambda Calculus Are Equal, Algebraically. FSCD 2023: 24:1-24:19 - [i7]Rafaël Bocquet, Ambrus Kaposi, Christian Sattler:
For the Metatheory of Type Theory, Internal Sconing Is Enough. CoRR abs/2302.05190 (2023) - [i6]Thorsten Altenkirch, Yorgo Chamoun, Ambrus Kaposi, Michael Shulman:
Internal parametricity, without an interval. CoRR abs/2307.06448 (2023) - 2022
- [c14]Thorsten Altenkirch, Ambrus Kaposi, Artjoms Sinkarovs, Tamás Végh:
The Münchhausen Method in Type Theory. TYPES 2022: 10:1-10:20 - 2021
- [c13]Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Christian Sattler, Filippo Sestini:
Constructing a universe for the setoid model. FoSSaCS 2021: 1-21 - [c12]István Donkó, Ambrus Kaposi:
Internal Strict Propositions Using Point-Free Equations. TYPES 2021: 6:1-6:21 - [i5]Rafaël Bocquet, Ambrus Kaposi, Christian Sattler:
Induction principles for type theories, internally to presheaf categories. CoRR abs/2102.11649 (2021) - 2020
- [j3]Ambrus Kaposi, András Kovács:
Signatures and Induction Principles for Higher Inductive-Inductive Types. Log. Methods Comput. Sci. 16(1) (2020) - [c11]Ambrus Kaposi, Jakob von Raumer:
A Syntax for Mutual Inductive Families. FSCD 2020: 23:1-23:21 - [c10]András Kovács, Ambrus Kaposi:
Large and Infinitary Quotient Inductive-Inductive Types. LICS 2020: 648-661 - [i4]András Kovács, Ambrus Kaposi:
Large and Infinitary Quotient Inductive-Inductive Types. CoRR abs/2006.11736 (2020)
2010 – 2019
- 2019
- [j2]Ambrus Kaposi, András Kovács, Thorsten Altenkirch:
Constructing quotient inductive-inductive types. Proc. ACM Program. Lang. 3(POPL): 2:1-2:24 (2019) - [c9]Thorsten Altenkirch, Simon Boulier, Ambrus Kaposi, Nicolas Tabareau:
Setoid Type Theory - A Syntactic Translation. MPC 2019: 155-196 - [c8]Ambrus Kaposi, András Kovács, Nicolai Kraus:
Shallow Embedding of Type Theory is Morally Correct. MPC 2019: 329-365 - [c7]Ambrus Kaposi, Simon Huber, Christian Sattler:
Gluing for Type Theory. FSCD 2019: 25:1-25:19 - [c6]Ambrus Kaposi, András Kovács, Ambroise Lafont:
For Finitary Induction-Induction, Induction Is Enough. TYPES 2019: 6:1-6:30 - [i3]Ambrus Kaposi, András Kovács:
Signatures and Induction Principles for Higher Inductive-Inductive Types. CoRR abs/1902.00297 (2019) - [i2]Ambrus Kaposi, András Kovács, Nicolai Kraus:
Shallow Embedding of Type Theory is Morally Correct. CoRR abs/1907.07562 (2019) - 2018
- [c5]Ambrus Kaposi, András Kovács:
A Syntax for Higher Inductive-Inductive Types. FSCD 2018: 20:1-20:18 - [e1]Andreas Abel, Fredrik Nordvall Forsberg, Ambrus Kaposi:
23rd International Conference on Types for Proofs and Programs, TYPES 2017, May 29-June 1, 2017, Budapest, Hungary. LIPIcs 104, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2018, ISBN 978-3-95977-071-2 [contents] - 2017
- [b1]Ambrus Kaposi:
Type theory in a type theory with quotient inductive types. University of Nottingham, UK, 2017 - [j1]Thorsten Altenkirch, Ambrus Kaposi:
Normalisation by Evaluation for Type Theory, in Type Theory. Log. Methods Comput. Sci. 13(4) (2017) - 2016
- [c4]Thorsten Altenkirch, Ambrus Kaposi:
Type theory in type theory using quotient inductive types. POPL 2016: 18-29 - [c3]Thorsten Altenkirch, Ambrus Kaposi:
Normalisation by Evaluation for Dependent Types. FSCD 2016: 6:1-6:16 - [i1]Thorsten Altenkirch, Ambrus Kaposi:
Normalisation by Evaluation for Type Theory, in Type Theory. CoRR abs/1612.02462 (2016) - 2015
- [c2]Thorsten Altenkirch, Ambrus Kaposi:
Towards a Cubical Type Theory without an Interval. TYPES 2015: 3:1-3:27 - 2014
- [c1]Paolo Capriotti, Ambrus Kaposi:
Free Applicative Functors. MSFP 2014: 2-30
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-06 23:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
