Pokaż uproszczony rekord

dc.contributor.authorFerreira, Fernando
dc.contributor.authorFerreira, Gilda
dc.date.accessioned2017-05-16T09:59:06Z
dc.date.available2017-05-16T09:59:06Z
dc.date.issued2016
dc.identifier.issn0138-0680
dc.identifier.urihttp://hdl.handle.net/11089/21620
dc.description.abstractWe give an elementary proof (in the sense that it is formalizable in Peano arithmetic) of the strong normalization of the atomic polymorphic calculus Fₐₜ (a predicative restriction of Girard’s system F).en_GB
dc.language.isoenen_GB
dc.publisherWydawnictwo Uniwersytetu Łódzkiegoen_GB
dc.relation.ispartofseriesBulletin of the Section of Logic;1
dc.subjectPredicative polymorphismen_GB
dc.subjectstrong normalizationen_GB
dc.subjectelementary proofsen_GB
dc.subjectlambda-calculusen_GB
dc.titleElementary Proof of Strong Normalization for Atomic Fen_GB
dc.typeArticleen_GB
dc.rights.holder© Copyright by Authors, Łódź 2016; © Copyright for this edition by Uniwersytet Łódzki, Łódź 2016en_GB
dc.page.number[1]-15
dc.contributor.authorAffiliationUniversidade de Lisboa, Faculdade de Ciências, Departamento de Matemática
dc.contributor.authorAffiliationUniversidade Lusófona de Humanidades e Tecnologias, Departamento de Matemática
dc.identifier.eissn2449-836X
dc.referencesT. Altenkirch and T. Coquand, A finitary subsystem of the polymorphic λ-calculus, Proceedings of the 5th International Conference on Typed Lambda Calculi and Applications (TLCA 2001), Lecture Notes in Computer Science 2044 (2001), pp. 22–28.en_GB
dc.referencesA. Beckmann, Exact bounds for lenghts of reductions in typed λ-calculus, The Journal of Symbolic Logic 66(3) (2001), pp. 1277–1285.en_GB
dc.referencesF. Ferreira, A simple proof of Parsons’ theorem, Notre Dame Journal of Formal Logic 46 (2005), pp. 83–91.en_GB
dc.referencesF. Ferreira, Comments on predicative logic, Journal of Philosophical Logic 35 (2006), pp. 1–8.en_GB
dc.referencesF. Ferreira and G. Ferreira, Atomic polymorphism, The Journal of Symbolic Logic 78 (2013), pp. 260–274.en_GB
dc.referencesF. Ferreira and G. Ferreira, The faithfulness of Fat: a proof-theoretic proof, Studia Logica 103(6) (2015), pp. 1303–1311.en_GB
dc.referencesJ.-Y. Girard, Y. Lafont and P. Taylor, Proofs and Types, Cambridge University Press (1989).en_GB
dc.referencesF. Joachimski and R. Matthes, Short proofs of normalization for the simplytyped lambda-calculus, permutative conversions and G¨odel’s T, Archive for Mathematical Logic 42 (2003), pp. 59–87.en_GB
dc.referencesH. Schwichtenberg, An upper bound for reduction sequences in the typed λ-calculus, Archive for Mathematical Logic 30 (1991), pp. 405–408.en_GB
dc.referencesW. Tait, Intentional interpretations of functionals of finite type I, The Journal of Symbolic Logic 32 (1967), pp. 198–212.en_GB
dc.referencesW. Tait, Finitism, Journal of Philosophy 78 (1981), pp. 524–546.en_GB
dc.referencesA. S. Troelstra and H. Schwichtenberg, Basic Proof Theory, Cambridge University Press (1996).en_GB
dc.referencesA. S. Troelstra and D. van Dalen, Constructivism in Mathematics. An Introduction, volume 1, North Holland, Amsterdam (1988).en_GB
dc.referencesJ. van de Pol, Two different strong normalization proofs? Computability versus functionals of finite type, Proceedings of the Second International Workshop on Higher-Order Algebra, Logic and Term Rewriting (HOA’95), Lecture Notes in Computer Science 1074 (1996), pp. 201–220.en_GB
dc.referencesF. van Raamsdonk and P. Severi, On normalization, Technical report CSR9545, Centrum voor Wiskunde en Informatica, Amsterdam (1995).en_GB
dc.contributor.authorEmailfjferreira@fc.ul.pt
dc.contributor.authorEmailgmferreira@fc.ul.pt
dc.identifier.doi10.18778/0138-0680.45.1.01
dc.relation.volume45en_GB


Pliki tej pozycji

Thumbnail

Pozycja umieszczona jest w następujących kolekcjach

Pokaż uproszczony rekord