Journal articles on the topic 'Martin-Löf Type Theory'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 44 journal articles for your research on the topic 'Martin-Löf Type Theory.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
Gambino, Nicola, and Peter Aczel. "The generalised type-theoretic interpretation of constructive set theory." Journal of Symbolic Logic 71, no. 1 (June 2006): 67–103. http://dx.doi.org/10.2178/jsl/1140641163.
Full textKLEV, ANSTEN. "ETA-RULES IN MARTIN-LÖF TYPE THEORY." Bulletin of Symbolic Logic 25, no. 03 (July 22, 2019): 333–59. http://dx.doi.org/10.1017/bsl.2019.21.
Full textLamarche, François. "Modeling Martin-Löf type theory in categories." Journal of Applied Logic 12, no. 1 (March 2014): 28–44. http://dx.doi.org/10.1016/j.jal.2013.08.003.
Full textAWODEY, STEVE, and MICHAEL A. WARREN. "Homotopy theoretic models of identity types." Mathematical Proceedings of the Cambridge Philosophical Society 146, no. 1 (January 2009): 45–55. http://dx.doi.org/10.1017/s0305004108001783.
Full textGARNER, RICHARD. "Two-dimensional models of type theory." Mathematical Structures in Computer Science 19, no. 4 (August 2009): 687–736. http://dx.doi.org/10.1017/s0960129509007646.
Full textObtułowicz, Adam. "Algebra of constructions II: an algebraic approach to Martin-Löf type theory and the calculus of constructions." Mathematical Structures in Computer Science 3, no. 1 (March 1993): 63–92. http://dx.doi.org/10.1017/s0960129500000128.
Full textPalmgren, Erik. "A construction of type: type in Martin-Löf's partial type theory with one universe." Journal of Symbolic Logic 56, no. 3 (September 1991): 1012–15. http://dx.doi.org/10.2307/2275068.
Full textSetzer, Anton. "Well-ordering proofs for Martin-Löf type theory." Annals of Pure and Applied Logic 92, no. 2 (May 1998): 113–59. http://dx.doi.org/10.1016/s0168-0072(97)00078-x.
Full textSetzer, Anton. "Extending Martin-Löf Type Theory by one Mahlo-universe." Archive for Mathematical Logic 39, no. 3 (April 1, 2000): 155–81. http://dx.doi.org/10.1007/s001530050140.
Full textObtułowicz, Adam. "Categorical and algebraic aspects of Martin-Löf Type Theory." Studia Logica 48, no. 3 (September 1989): 299–317. http://dx.doi.org/10.1007/bf00370827.
Full textRathjen, Michael, and Sergei Tupailo. "Characterizing the interpretation of set theory in Martin-Löf type theory." Annals of Pure and Applied Logic 141, no. 3 (September 2006): 442–71. http://dx.doi.org/10.1016/j.apal.2005.12.008.
Full textDomanov, Oleg. "FUZZY TYPE THEORY IN THE ANALYSIS OF ARGUMENTATION." Respublica literaria, RL. 2021. vol.2. no. 1 (March 29, 2021): 37–47. http://dx.doi.org/10.47850/rl.2021.2.1.37-47.
Full textRodin, Andrei V. "Martin-Löf Type Theory as a Multi-Agent Epistemic Formal System." Epistemology & Philosophy of Science 55, no. 4 (2018): 44–47. http://dx.doi.org/10.5840/eps201855464.
Full textAbel, Andreas, Klaus Aehlig, and Peter Dybjer. "Normalization by Evaluation for Martin-Löf Type Theory with One Universe." Electronic Notes in Theoretical Computer Science 173 (April 2007): 17–39. http://dx.doi.org/10.1016/j.entcs.2007.02.025.
Full textBunder, M. W. "Possible forms of evaluation or reduction in Martin-Löf type theory." Theoretical Computer Science 41 (1985): 113–20. http://dx.doi.org/10.1016/0304-3975(85)90065-9.
Full textGYLTERUD, HÅKON ROBBESTAD. "FROM MULTISETS TO SETS IN HOMOTOPY TYPE THEORY." Journal of Symbolic Logic 83, no. 3 (September 2018): 1132–46. http://dx.doi.org/10.1017/jsl.2017.84.
Full textBARRAS, BRUNO, THIERRY COQUAND, and SIMON HUBER. "A generalization of the Takeuti–Gandy interpretation." Mathematical Structures in Computer Science 25, no. 5 (February 20, 2015): 1071–99. http://dx.doi.org/10.1017/s0960129514000504.
Full textPalmgren, Erik. "A note on Mathematics of infinity." Journal of Symbolic Logic 58, no. 4 (December 1993): 1195–200. http://dx.doi.org/10.2307/2275138.
Full textRathjen, Michael. "The strength of Martin-Löf type theory with a superuniverse. Part II." Archive for Mathematical Logic 40, no. 3 (April 1, 2001): 207–33. http://dx.doi.org/10.1007/s001530000051.
Full textRathjen, Michael. "The strength of Martin-Löf type theory with a superuniverse. Part I." Archive for Mathematical Logic 39, no. 1 (January 1, 2000): 1–39. http://dx.doi.org/10.1007/s001530050001.
Full textRathjen, Michael. "The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory." Synthese 147, no. 1 (October 2005): 81–120. http://dx.doi.org/10.1007/s11229-004-6208-4.
Full textGYLTERUD, HÅKON ROBBESTAD. "Multisets in type theory." Mathematical Proceedings of the Cambridge Philosophical Society 169, no. 1 (March 27, 2019): 1–18. http://dx.doi.org/10.1017/s0305004119000045.
Full textCARL, MERLIN, and PHILIPP SCHLICHT. "RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY." Journal of Symbolic Logic 83, no. 2 (June 2018): 766–89. http://dx.doi.org/10.1017/jsl.2018.3.
Full textPalmgren, E. "An Information System Interpretation of Martin-Löf′s Partial Type Theory with Universes." Information and Computation 106, no. 1 (September 1993): 26–60. http://dx.doi.org/10.1006/inco.1993.1048.
Full textGarner, Richard. "On the strength of dependent products in the type theory of Martin-Löf." Annals of Pure and Applied Logic 160, no. 1 (July 2009): 1–12. http://dx.doi.org/10.1016/j.apal.2008.12.003.
Full textPALMGREN, ERIK. "A CONSTRUCTIVE EXAMINATION OF A RUSSELL-STYLE RAMIFIED TYPE THEORY." Bulletin of Symbolic Logic 24, no. 1 (March 2018): 90–106. http://dx.doi.org/10.1017/bsl.2018.4.
Full textSmith, Jan M. "The independence of Peano's fourth axiom from Martin-Löf's type theory without universes." Journal of Symbolic Logic 53, no. 3 (September 1988): 840–45. http://dx.doi.org/10.2307/2274575.
Full textPISTONE, PAOLO. "POLYMORPHISM AND THE OBSTINATE CIRCULARITY OF SECOND ORDER LOGIC: A VICTIMS’ TALE." Bulletin of Symbolic Logic 24, no. 1 (March 2018): 1–52. http://dx.doi.org/10.1017/bsl.2017.43.
Full textNormann, Dag, Erik Palmgren, and Viggo Stoltenberg-Hansen. "Hyperfinite type structures." Journal of Symbolic Logic 64, no. 3 (September 1999): 1216–42. http://dx.doi.org/10.2307/2586626.
Full textCHAPMAN, JAMES, TARMO UUSTALU, and NICCOLÒ VELTRI. "Quotienting the delay monad by weak bisimilarity." Mathematical Structures in Computer Science 29, no. 1 (October 17, 2017): 67–92. http://dx.doi.org/10.1017/s0960129517000184.
Full textBuchholz, Wilfried. "Anton Setzer. Well-ordering proofs for Martin-Löf type theory. Annals of pure and applied logic, vol. 92 (1998), pp. 113–159." Bulletin of Symbolic Logic 6, no. 4 (December 2000): 478–79. http://dx.doi.org/10.2307/420979.
Full textHoward, W. A. "Per Martin-Löf. Intuitionistic type theory. (Notes by Giovanni Sambin of a series of lectures given in Padua, June 1980.) Studies in proof theory. Bibliopolis, Naples1984, ix + 91 pp." Journal of Symbolic Logic 51, no. 4 (December 1986): 1075–76. http://dx.doi.org/10.2307/2273925.
Full textMöllerfeld, Michael. "Michael Rathjen. The superjump in Martin-Löf type theory. Logic Colloquium '98, Proceedings of the annual European summer meeting of the Association for Symbolic Logic, held in Prague, Czech Republic, August 9–15, 1998, edited by Samuel R. Buss, Petr Hájek, and Pavel Pudlák, Lecture notes in logic, no. 13, Association for Symbolic Logic, Urbana, and A K Peters, Natick, Mass., 2000, pp. 363–386." Bulletin of Symbolic Logic 8, no. 4 (December 2002): 538. http://dx.doi.org/10.2178/bsl/1182353932.
Full textKlev, Ansten. "Identity in Martin‐Löf type theory." Philosophy Compass 17, no. 2 (December 28, 2021). http://dx.doi.org/10.1111/phc3.12805.
Full textCLAIRAMBAULT, PIERRE, and PETER DYBJER. "The biequivalence of locally cartesian closed categories and Martin-Löf type theories." Mathematical Structures in Computer Science 24, no. 6 (April 29, 2014). http://dx.doi.org/10.1017/s0960129513000881.
Full textSetzer, Anton. "Proof Theory of Martin-Löf Type Theory. An overview." Mathématiques et sciences humaines, no. 165 (March 1, 2004). http://dx.doi.org/10.4000/msh.2959.
Full textWallet, Guy. "Choice sequence and nonstandard extension of type theory." Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées Volume 20 - 2015 - Special... (September 17, 2015). http://dx.doi.org/10.46298/arima.1995.
Full textGAMBINO, NICOLA, and MARCO FEDERICO LARREA. "MODELS OF MARTIN-LÖF TYPE THEORY FROM ALGEBRAIC WEAK FACTORISATION SYSTEMS." Journal of Symbolic Logic, June 8, 2021, 1–45. http://dx.doi.org/10.1017/jsl.2021.39.
Full textABEL, ANDREAS, JESPER COCKX, DOMINIQUE DEVRIESE, AMIN TIMANY, and PHILIP WADLER. "Leibniz equality is isomorphic to Martin-Löf identity, parametrically." Journal of Functional Programming 30 (2020). http://dx.doi.org/10.1017/s0956796820000155.
Full textANGIULI, CARLO, EDWARD MOREHOUSE, DANIEL R. LICATA, and ROBERT HARPER. "Homotopical patch theory." Journal of Functional Programming 26 (2016). http://dx.doi.org/10.1017/s0956796816000198.
Full textEmmenegger, Jacopo, Fabio Pasquali, and Giuseppe Rosolini. "Elementary fibrations of enriched groupoids." Mathematical Structures in Computer Science, November 19, 2021, 1–21. http://dx.doi.org/10.1017/s096012952100030x.
Full textPetrakis, Iosif. "Proof-relevance in Bishop-style constructive mathematics." Mathematical Structures in Computer Science, May 31, 2022, 1–43. http://dx.doi.org/10.1017/s0960129522000159.
Full textUUSTALU, TARMO, and NICCOLÒ VELTRI. "Finiteness and rational sequences, constructively." Journal of Functional Programming 27 (2017). http://dx.doi.org/10.1017/s0956796817000041.
Full textBezem, Marc, Thierry Coquand, Peter Dybjer, and Martín Escardó. "On generalized algebraic theories and categories with families." Mathematical Structures in Computer Science, October 18, 2021, 1–18. http://dx.doi.org/10.1017/s0960129521000268.
Full text