Mathematical structures in natural language semantics: Zawadowski’s contribution to linguistics.

Συγγραφείς: Chatzikyriakidis, Stergios, 0, Author, Cooper, Robin, 1947, Author

Συνεισφορές: Chatzikyriakidis, Stergios, 0, Author, Cooper, Robin, 1947, Author

Πηγή: Mathematical Structures in Computer Science. 36:1-12

Θεματικοί όροι: Natural Language Processing, Språkbehandling och datorlingvistik, Comparative Language Studies and Linguistics, Jämförande språkvetenskap och allmän lingvistik, type theory, set theory, dependent types, generalized quantifiers, anaphora continuations

Σύνδεσμος πρόσβασης: https://gup.ub.gu.se/publication/362640

Abstraction Functions as Types: Modular Verification of Cost and Behavior in Dependent Type Theory

Συγγραφείς: Grodin, Harrison, Li, Runming, Harper, Robert

Πηγή: Proceedings of the ACM on Programming Languages. 10(POPL):895-922

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3776673

Type Theory for (∞,∞)-Categories, and Decomposition Spaces

Συγγραφείς: Mikhail, Thomas Jan

Thesis Advisors: Kock, Joachim, Pitsch , Wolfgang Karl David

Πηγή: TDX (Tesis Doctorals en Xarxa)

Θεματικοί όροι: Teoria de tipus, Type Theory, Teoría de tipos, Teoria de categories, Category Theory, Teoría de categorías, Espais de descomposició, Decomposition Spaces, Espacios de descomposición, Ciències Experimentals

Περιγραφή αρχείου: application/pdf

Σύνδεσμος πρόσβασης: https://hdl.handle.net/10803/695093

Seeing Metamorphic Relations Families as Types: Towards a New Foundation of Metamorphic Testing

Συγγραφείς: Gotlieb, Arnaud, Le Louedec, Mathieu, Spieker, Helge

Πηγή: 2026 IEEE 50th Annual Computers, Software, and Applications Conference (COMPSAC) COMPSAC Computers, Software, and Applications Conference (COMPSAC), 2026 IEEE 50th Annual. :2453-2458 Jul, 2026

Relation: 2026 IEEE 50th Annual Computers, Software, and Applications Conference (COMPSAC)

Nested Inductive Types: Justified and Usable Nested Inductive Types in Lean and Rocq

Συγγραφείς: Lamiaux, Thomas, Forster, Yannick, Sozeau, Matthieu, Tabareau, Nicolas

Πηγή: Proceedings of the ACM on Programming Languages. 10(PLDI):1891-1914

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3808322

Di- is for Directed: First-Order Directed Type Theory via Dinaturality

Συγγραφείς: Laretto, Andrea, Loregian, Fosco, Veltri, Niccolò

Πηγή: Proceedings of the ACM on Programming Languages. 10(POPL):1759-1789

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3776703

Bounded Sort Polymorphism with Elimination Constraints

Συγγραφείς: Rosain, Johann, Díaz, Tomás, Maillard, Kenji, Sozeau, Matthieu, Tabareau, Nicolas, Tanter, Éric, Winterhalter, Théo

Πηγή: Proceedings of the ACM on Programming Languages. 10(POPL):2614-2642

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3776732

From Semantics to Syntax: A Type Theory for Comprehension Categories

Συγγραφείς: Najmaei, Niyousha, van der Weide, Niels, Ahrens, Benedikt, North, Paige Randall

Πηγή: Proceedings of the ACM on Programming Languages. 10(POPL):2409-2438

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3776725

Encode the Cake and Eat It Too: Controlling Computation in Type Theory, Locally

Συγγραφείς: Leray, Yann, Winterhalter, Théo

Πηγή: Proceedings of the ACM on Programming Languages. 10(POPL):1790-1819

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3776704

Normalisation for First-Class Universe Levels

Συγγραφείς: Danielsson, Nils Anders, Favier, Naïm Camille, Kubánek, Ondřej

Πηγή: Proceedings of the ACM on Programming Languages. 10(POPL):64-88

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3776645

THE ITERATION OF THE MATHEMATICAL PROCESS.

Συγγραφείς: CONTENTE, MICHELE¹ (AUTHOR) michelecontente@gmail.com

Πηγή: Review of Symbolic Logic. Sep2026, Vol. 19 Issue 3, p427-458. 32p.

Θεματικοί όροι: *Nonclassical mathematical logic, *Intuitionistic type theory, *Mathematicians, *Mathematical analysis, *Homotopy theory

On Recursion in Graded Modal Type Theory

Συγγραφείς: Eriksson, Oskar, 1997, Author, Abel, Andreas Martin, 1974, Author, Danielsson, Nils Anders, 1979, Author

Συνεισφορές: Eriksson, Oskar, 1997, Author, Abel, Andreas Martin, 1974, Author, Danielsson, Nils Anders, 1979, Author

Πηγή: Proceedings of the ACM on Programming Languages. 10(ICFP)

Θεματικοί όροι: Computer Sciences, Datavetenskap (datalogi), abstract machine, dependent types, formalization, graded modal type theory, linearity, quantitative type theory

Σύνδεσμος πρόσβασης: https://gup.ub.gu.se/publication/366536

Information types in intuitionistic predicate logic with constant domains.

Συγγραφείς: Punčochář, Vít¹ (AUTHOR), Noguera, Carles² (AUTHOR)

Πηγή: Logic Journal of the IGPL. Feb2026, Vol. 34 Issue 1, p1-21. 21p.

Θεματικοί όροι: Semantics, Intuitionistic type theory, Disjunction (Logic), Intuitionistic mathematics, Mathematical logic, Kripke semantics

Archival Research Theory: Putting Smart Technology to Work for Researchers

Συγγραφείς: Thibodeau, Kenneth, Richmond, Alex, Beauchamp, Mario

Πηγή: 2025 IEEE International Conference on Big Data (BigData) Big Data (BigData), 2025 IEEE International Conference on. :6044-6051 Dec, 2025

Relation: 2025 IEEE International Conference on Big Data (BigData)

Automating Boundary Filling in Cubical Type Theories

Συγγραφείς: Doré, Maximilian, Author, Cavallo, Evan, Author, Mörtberg, Anders, 1986-, Author

Συνεισφορές: Doré, Maximilian, Author, Cavallo, Evan, Author, Mörtberg, Anders, 1986-, Author

Πηγή: Logical Methods in Computer Science. 22(2)

Θεματικοί όροι: Automated Reasoning, Constraint Satisfaction Programming, Cubical Type Theory

Περιγραφή αρχείου: print

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-259040
https://doi.org/10.46298/lmcs-22(2:28)2026

A quantitative type based framework for synchronous system design

Συγγραφείς: Chen, Rui, Author, Sander, Ingo, Professor, 1964-, Author

Συνεισφορές: Chen, Rui, Author, Sander, Ingo, Professor, 1964-, Author

Πηγή: Journal of systems architecture. 179

Θεματικοί όροι: Embedded system design, Functional programming, Proof assistant, Quantitative type theory

Περιγραφή αρχείου: print

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-386391
https://doi.org/10.1016/j.sysarc.2026.103911

Homotopy type theory as a language for diagrams of ∞-logoses

Συγγραφείς: Uemura, Taichi, Author

Συνεισφορές: Uemura, Taichi, Author

Πηγή: Logical Methods in Computer Science. 22(1)

Θεματικοί όροι: and phrases: homotopy type theory, Artin gluing, logical relation, modality, oplax limit, synthetic Tait computability, ∞-logos, ∞-topos

Περιγραφή αρχείου: print

Σύνδεσμος πρόσβασης: https://urn.kb.se/resolve?urn=urn:nbn:se:su:diva-254481
https://doi.org/10.46298/lmcs-22(1:25)2026

A Certifying Proof Assistant for Synthetic Mathematics in Lean

Συγγραφείς: Nawrocki, Wojciech, Hua, Joseph, Carneiro, Mario, Xu, Yiming, Woolfson, Spencer, Rong, Shuge, Hazratpour, Sina, Awodey, Steve

Πηγή: Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs. :88-103

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3779031.3779087

Mechanizing Synthetic Tait Computability in Istari

Συγγραφείς: Li, Runming, Yao, Yue, Harper, Robert

Πηγή: Proceedings of the 15th ACM SIGPLAN International Conference on Certified Programs and Proofs. :231-247

Διαθεσιμότητα: http://dl.acm.org/doi/10.1145/3779031.3779085

The Yoneda embedding in simplicial type theory

Συγγραφείς: Gratzer, Daniel, Weinberger, Jonathan, Buchholtz, Ulrik

Πηγή: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) LICS Logic in Computer Science (LICS), 2025 40th Annual ACM/IEEE Symposium on. :127-142 Jun, 2025

Relation: 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)