![]() J Symb Log 57(3):795–807ĭyckhoff R (2018) Contraction-free sequent calculi for intuitionistic logic: a correction. EWD 303ĭyckhoff R (1992) Contraction-free sequent calculi for intuitionistic logic. ACM, pp 223–234ĭijkstra EW (1971) On the reliability of programs. In: CCS ’13: proceedings of the 2013 ACM SIGSAC conference on computer & communications security. J Autom Reason 61(1–4):423–453ĭam M, Guanciale R, Khakpour N, Nemati H, Schwarz O (2013) Formal verification of information flow security for a simple ARM-based separation kernel. PhD thesis, University of NijmegenĬzajka Ł, Kaliszyk C (2018) Hammer for Coq: automation for dependent type theory. Springer, Berlin, pp 50–66Ĭruz-Filipe L (2004) Constructive real analysis: a type-theoretical formalization and applications. Lecture notes in computer science, vol 417. In: Martin-Löf P, Mints G (eds) COLOG-88: proceedings of the international conference on computer logic. Inf Comput 76(2–3):95–120Ĭoquand T, Paulin C (1990) Inductively defined types. ACM, pp 255–264Ĭoquand T, Huet G (1988) The calculus of constructions. In: LICS ’18: proceedings of the 33rd annual ACM/IEEE symposium on logic in computer science. Springer, Berlin, pp 71–84Ĭoquand T, Huber S, Mörtberg A (2018) On higher inductive types in cubical type theory. In: Nordström B, Petersson K, Plotkin G (eds) Proceedings of the 1992 workshop on types for proofs and programs. arXiv:1611.02108Ĭoquand T (1992) Pattern matching with dependent types. Proc ACM Program Lang 2(ICFP), Article 75:1–30Ĭohen C, Coquand T, Huber S, Mörtberg A (2016) Cubical type theory: a constructive interpretation of the univalence axiom. ACM, pp 270–286Ĭockx J, Abel A (2018) Elaborating dependent (co)pattern matching. In: SOSP ’17: proceedings of the 26th symposium on operating systems principles. ACM, pp 299–312Ĭhen H, Chajed T, Konradi A, Wang S, İleri A, Chlipala A, Kaashoek F, Zeldovich N (2017) Verifying a high-performance crash-safe file system using a tree specification. In: CPP 2020: proceedings of the 9th ACM SIGPLAN international conference on certified programs and proofs. Commun ACM 21(10):806–820īuzzard K, Commelin J, Massot P (2020) Formalising perfectoid spaces. J Autom Reason 61(1):333–365īove A, Capretta V (2005) Modelling general recursion in type theory. J ACM 66(1), Article 1:1–77īlanchette JC, Fleury M, Lammich P, Weidenbach C (2018) A verified SAT solver framework with learn, forget, restart, and incrementality. Springer, Berlinīishop S, Fairbairn M, Mehnert H, Norrish M, Ridge T, Sewell P, Smith M, Wansbrough K (2018) Engineering with logic: rigorous test-oracle specification and validation for TCP/IP and the sockets API. Hist Math 2(4):507–517īishop E, Bridges D (1985) Constructive analysis. ACM SIGPLAN Not 42(10):301–320īishop E (1975) The crisis in contemporary mathematics. Springer, pp 48–62īierhoff K, Aldrich J (2007) Modular typestate checking of aliased objects. ![]() Lecture notes in computer science, vol 4502. In: Altenkirch T, McBride C (eds) Types for proofs and programs-TYPES 2006. Modell Simul Mater Sci Eng 17(4):043001īesson F (2007) Fast reflexive arithmetic tactics the linear case and beyond. ACM, pp 164–172īelytschko T, Gracie R, Ventura G (2009) A review of extended/generalized finite element methods for material modeling. ![]() In: CPP 2017: proceedings of the 6th ACM SIGPLAN conference on certified programs and proofs. īauer A, Gross J, Lumsdaine PL, Shulman M, Sozeau M, Spitters B (2017) The HoTT library: a formalization of homotopy type theory in Coq. J Funct Program 13(2):261–293īauer A (2020) Answer to the question: What makes dependent type theory more suitable than set theory for proof assistants? MathOverflow. IEEE, pp 95–104īarthe G, Capretta V, Pons O (2003) Setoids in type theory. In: LICS ’12: proceedings of the 2012 27th annual IEEE/ACM symposium on logic in computer science. Proc ACM Program Lang 3(POPL), Article 71:1–31Īwodey S, Gambino N, Sojakova K (2012) Inductive types in homotopy type theory. Proc ACM Program Lang 5(POPL), Article 12:1–30Īrmstrong A, Bauereiss T, Campbell B, Reid A, Gray KE, Norton RM, Mundkur P, Wassell M, French J, Pulte C, Flur S, Stark I, Krishnaswami N, Sewell P (2019) ISA semantics for ARMv8-a, RISC-v, and CHERI-MIPS. Angiuli C, Cavallo E, Mörtberg A, Zeuner M (2021) Internalizing representation independence with univalence.
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |