Blog
About

130
views
0
recommends
+1 Recommend
1 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Conference Proceedings: found
      Is Open Access

      Tait in One Big Step

      ,

      Workshop on Mathematically Structured Functional Programming (MSFP 2006) (MSFP)

      Mathematically Structured Functional Programming

      2 July 2006

      Normalisation, Strong Computability

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          We present a Tait-style proof to show that a simple functional normaliser for a combinatory version of System T terminates. Using a technique pioneered by Bove and Capretta, we can implement the normaliser in total Type Theory. The main interest in our construction is methodological, it is an alternative to the usual small-step operational semantics on the one side and normalisation by evaluation on the other. The present work is motivated by our longer term goal to verify implementations of Type Theory such as Epigram.

          Related collections

          Most cited references 7

          • Record: found
          • Abstract: found
          • Article: not found

          Intensional interpretations of functionals of finite type I

           W. W. Tait (1967)
          T0 will denote Gödel's theory T[3] of functionals of finite type (f.t.) with intuitionistic quantification over each f.t. added. T1 will denote T0 together with definition by bar recursion of type o, the axiom schema of bar induction, and the schema
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            The view from the left

              Bookmark
              • Record: found
              • Abstract: not found
              • Book Chapter: not found

              Categorical reconstruction of a reduction free normalization proof

                Bookmark

                Author and article information

                Contributors
                Conference
                July 2006
                July 2006
                : 1-10
                Affiliations
                School of Computer Science and IT, University of Nottingham

                Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK
                Article
                10.14236/ewic/MSFP2006.4
                © Thorsten Altenkirch et al. Published by BCS Learning and Development Ltd. Workshop on Mathematically Structured Functional Programming (MSFP 2006), Kuressaare, Estonia

                This work is licensed under a Creative Commons Attribution 4.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by/4.0/

                Workshop on Mathematically Structured Functional Programming (MSFP 2006)
                MSFP
                Kuressaare, Estonia
                2 July 2006
                Electronic Workshops in Computing (eWiC)
                Mathematically Structured Functional Programming
                Product
                Product Information: 1477-9358BCS Learning & Development
                Self URI (journal page): https://ewic.bcs.org/
                Categories
                Electronic Workshops in Computing

                Comments

                Comment on this article