Skip to main content
SpringerLink
Log in

Relating type-structures partial variations on a theme of Friedman and Statman

  • Logic For Computing
  • Conference paper
  • First Online:
CAAP '86 (CAAP 1986)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 214))

Included in the following conference series:

  • 128 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Asperti A., Longo G. [1986] "Categories of partial morphisms and the relation between type-structures", Dip. di Inf., Pisa.

    Google Scholar 

  • Barendregt H. [1984], The lambda calculus; its syntax and semantics, Revised edition, North Holland.

    Google Scholar 

  • Berry G. [1979] "Modèles complètement adequats et stables des lambda-calculus types", Thèse de Doctorat, Universite' Paris VII.

    Google Scholar 

  • Berry G., Curien P.L. "Sequential Algorithms on Concrete Data Structures" Theor. Comp. Sci. 20, (265–321).

    Google Scholar 

  • Dibjer P. [1983], "Category-theoretic logics and algebras of programs," Ph.D. Thesis, Chalmers University, Goeteborg.

    Google Scholar 

  • Di Paola A., Heller A. [1984] "Dominical Categories," City Univ. New York.

    Google Scholar 

  • Ershov Yu. L. [1976] "Model C of the partial continuous functionals," Logic Colloquium 76 (Gandy, Hyland eds.) North Holland, 1977.

    Google Scholar 

  • Friedman H. [1975], "Equality between functionals," Logic Colloquium (Parikh ed.), LNM 453, Springer-Verlag.

    Google Scholar 

  • Giannini P., Longo G. [1984] "Effectively given domains and lambda calculus semantics," Info.&Contr. 62, 1 (36–63).

    Google Scholar 

  • Gödel K. [1958] "Ueber eine bicher noch nicht benuetze Erweiterung des finiten Standpuntes," Dialectica, vol.12, pp.280–287.

    Google Scholar 

  • Hyland M. [1982] "The effective Topos," in The Brouwer Symposium, (TrÅ“lstra, Van Dalen eds.) North-Holland.

    Google Scholar 

  • Lambek J. [1980] "From lamba-calculus to car tesian closed categories," in Hindley/Seldin[1980].

    Google Scholar 

  • Longo G., Moggi E. [1984] "The Hereditary Partial Recursive Functionals and Recursion Theory in higher types," J. Symb. Logic, vol. 49, (pp. 1319–1332).

    Google Scholar 

  • Longo G., Moggi E. [1984p] "Goedel-numberings, principal morphisms, Combinatory Algebras: a category-theoretic characterization of functional completeness," (prelim. version) Math. Found. Comp. Sci., Prague 1984 (Chytil, Koubek eds.) INCS 176, Springer-Verlag, 1984 (pp. 397–406).

    Google Scholar 

  • Longo G., Moggi E. [1984a] "Cartesian Closed Categories of Enumerations and effective Type Structures," Symposium on Semantics of Data Types (Khan, MacQueen, Plotkin eds.), LNCS 173, Springer-Verlag, (pp. 235–247).

    Google Scholar 

  • Moggi E. [1985] "Partial Morphisms in Categories of effective objects," Comp. Sci. Dept., Univ. of Edinburgh.

    Google Scholar 

  • Plotkin G. [1980/84] "Domains", lecture notes, C.S. Dept. Edinburgh

    Google Scholar 

  • Plotkin G. [1982] "Notes on completeness of the full continous type hierarchy", Manuscript, M.I.T.

    Google Scholar 

  • Poigne' A. [1985] "On specification Theories and Models with higher types", to appear in Info.&Contr.

    Google Scholar 

  • Rosolini G. [1985] "Domains and dominical categories", C.S. Dept., C.M.U.

    Google Scholar 

  • Scott D. [1976] "Data types as lattices," SIAM Journal of Computing, 5 (pp. 522–587).

    Google Scholar 

  • Scott D. [1980] "Relating theories of the lambda-calculus," in To H.B. Curry: essays in lambdacalculus...Hindley, Seldin (eds.), Academic Press.

    Google Scholar 

  • Scott D. [1982] "Domains for denotational semantics," (preliminary version), Proceedings ICALP 82, LNCS 140, Springer-Verlag).

    Google Scholar 

  • Smyth M. [1977] "Effectively Given Domains", Theoret. Comput. Sci. 5, pp 255–272.

    Google Scholar 

  • Smyth M., Plotkin G. [1982] "The category-theoretic solution of recursive domain equations" SIAM Journal of Computing 11, (pp.761–783).

    Google Scholar 

  • Statman R. [1980] "Completeness, invariance and lambda-definability," J. Symb. Logic 47, 1, (pp. 17–26).

    Google Scholar 

  • Statman R. [1984] "Logical relations and typed lambda-calculus" Info&Contr. (to appear).

    Google Scholar 

  • Statman R. [1985] "Equality between functionals revisited" in H. Friedman's research on the found. of Math. (Harrington et al. eds), North Holland.

    Google Scholar 

  • Troelstra A. [1973] "Metamathematical investigation of Intuitionistic Arithmetic and Analysis," LNM 344, Springer-Verlag, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Informatica, Corso Italia 40, I-56100, Pisa

    Andrea Asperti & Giuseppe Longo

Authors
  1. Andrea Asperti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Longo
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paul Franchi-Zannettacci

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag

About this paper

Cite this paper

Asperti, A., Longo, G. (1986). Relating type-structures partial variations on a theme of Friedman and Statman. In: Franchi-Zannettacci, P. (eds) CAAP '86. CAAP 1986. Lecture Notes in Computer Science, vol 214. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022674

Download citation

  • DOI: https://doi.org/10.1007/BFb0022674

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16443-2

  • Online ISBN: 978-3-540-39783-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation