Interpreting higher computations as types with totality

&
Archive for Mathematical Logic 33 (4):243-259 (1994)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

DOI

10.1007/bf01270624

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,931

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Total objects in inductively defined types.Lill Kristiansen & Dag Normann - 1997 - Archive for Mathematical Logic 36 (6):405-436.
Computations in higher types.Johan Moldestad - 1977 - New York: Springer Verlag.
Reply to Martin.D. M. Armstrong - 1997 - Australasian Journal of Philosophy 75 (2):214 – 217.
Exploring feature agreement in French with parallel pregroup computations.Joachim Lambek - 2010 - Journal of Logic, Language and Information 19 (1):75-88.
Classical truth in higher types.Ulrich Berger - 2008 - Mathematical Logic Quarterly 54 (3):240-246.
Kolmogorov complexity for possibly infinite computations.Verónica Becher & Santiago Figueira - 2005 - Journal of Logic, Language and Information 14 (2):133-148.
Reduction of Biological Properties by Means of Functional Sub-Types.Christian Sachse - 2005 - History and Philosophy of the Life Sciences 27 (3/4):435 - 449.
Denotational semantics for intuitionistic type theory using a hierarchy of domains with totality.Geir Waagbø - 1999 - Archive for Mathematical Logic 38 (1):19-60.
Opening Business Stuents’ Eyes.Denise Baden, Edgar Meyer & Marianna Tonne - 2011 - Proceedings of the International Association for Business and Society 22:511-523.
A faithful embedding of parallel computations in star-finite models.E. J. Farkas - 1988 - Studia Logica 47 (3):203 - 212.
The Computational Power of ℳω.Dag Normann & Christian Rørdam - 2002 - Mathematical Logic Quarterly 48 (1):117-124.
Extensions of arithmetic for proving termination of computations.Clement F. Kent & Bernard R. Hodgson - 1989 - Journal of Symbolic Logic 54 (3):779-794.
Numerical computations and mathematical modelling with infinite and infinitesimal numbers.Yaroslav Sergeyev - 2009 - Journal of Applied Mathematics and Computing 29:177-195.

Analytics

Added to PP
2013-11-23

Downloads
27 (#608,062)

6 months
4 (#862,463)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Normann
University of Oslo

Citations of this work

Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.
Equational theories for inductive types.Ralph Loader - 1997 - Annals of Pure and Applied Logic 84 (2):175-217.
Can partial indexings be totalized?Dieter Spreen - 2001 - Journal of Symbolic Logic 66 (3):1157-1185.

Add more citations

References found in this work

[product]¹2-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2):75.
Π12-logic, Part 1: Dilators.Jean-Yves Girard - 1981 - Annals of Mathematical Logic 21 (2-3):75-219.
Total sets and objects in domain theory.Ulrich Berger - 1993 - Annals of Pure and Applied Logic 60 (2):91-117.
Total objects in inductively defined types.Lill Kristiansen & Dag Normann - 1997 - Archive for Mathematical Logic 36 (6):405-436.

Add more references