Ambrus Kaposi

Orcid: 0000-0001-9897-8936

According to our database1, Ambrus Kaposi authored at least 22 papers between 2014 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Internal Parametricity, without an Interval.
Proc. ACM Program. Lang., January, 2024

2023
For the Metatheory of Type Theory, Internal Sconing Is Enough.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

Combinatory Logic and Lambda Calculus Are Equal, Algebraically.
Proceedings of the 8th International Conference on Formal Structures for Computation and Deduction, 2023

2022
The Münchhausen Method in Type Theory.
Proceedings of the 28th International Conference on Types for Proofs and Programs, 2022

2021
Induction principles for type theories, internally to presheaf categories.
CoRR, 2021

Internal Strict Propositions Using Point-Free Equations.
Proceedings of the 27th International Conference on Types for Proofs and Programs, 2021

Constructing a universe for the setoid model.
Proceedings of the Foundations of Software Science and Computation Structures, 2021

2020
Signatures and Induction Principles for Higher Inductive-Inductive Types.
Log. Methods Comput. Sci., 2020

Large and Infinitary Quotient Inductive-Inductive Types.
Proceedings of the LICS '20: 35th Annual ACM/IEEE Symposium on Logic in Computer Science, 2020

A Syntax for Mutual Inductive Families.
Proceedings of the 5th International Conference on Formal Structures for Computation and Deduction, 2020

2019
Constructing quotient inductive-inductive types.
Proc. ACM Program. Lang., 2019

For Finitary Induction-Induction, Induction Is Enough.
Proceedings of the 25th International Conference on Types for Proofs and Programs, 2019

Gluing for Type Theory.
Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

Shallow Embedding of Type Theory is Morally Correct.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

Setoid Type Theory - A Syntactic Translation.
Proceedings of the Mathematics of Program Construction - 13th International Conference, 2019

2018
A Syntax for Higher Inductive-Inductive Types.
Proceedings of the 3rd International Conference on Formal Structures for Computation and Deduction, 2018

2017
Type theory in a type theory with quotient inductive types.
PhD thesis, 2017

Normalisation by Evaluation for Type Theory, in Type Theory.
Log. Methods Comput. Sci., 2017

2016
Normalisation by Evaluation for Dependent Types.
Proceedings of the 1st International Conference on Formal Structures for Computation and Deduction, 2016

Type theory in type theory using quotient inductive types.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

2015
Towards a Cubical Type Theory without an Interval.
Proceedings of the 21st International Conference on Types for Proofs and Programs, 2015

2014
Free Applicative Functors.
Proceedings of the Proceedings 5th Workshop on Mathematically Structured Functional Programming, 2014


  Loading...