{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:19:39Z","timestamp":1794338379115,"version":"4.9.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":51,"publisher":"Springer-Verlag","isbn-type":[{"value":"3540133720","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0030292","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T10:19:29Z","timestamp":1138184369000},"page":"96-114","source":"Crossref","is-referenced-by-count":0,"title":["Limits, higher type computability and type-free languages"],"prefix":"10.1007","author":[{"given":"G.","family":"Longo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Albano A., Cardelli L., Orsini R. (1983) \"Galileo: a strongly typed, Interactive Conceptual Language\" Tech. Note 30 C.S. Dept. Toronto (revised: Tech. rep. 83-11271-2, Bell Lab.)."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Barendregt H. (1978) \"The type-free lambda-calculus\" in Handbook of Math. Logic (Barwise ed.), North-Holland.","DOI":"10.1016\/S0049-237X(08)71129-7"},{"key":"7_CR3","unstructured":"Barendregt H. (1984) The lambda-calculus: its syntax and semantics (revised and expanded edition), North-Holland."},{"issue":"4","key":"7_CR4","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. Barendregt","year":"1983","unstructured":"Barendregt H., Coppo M., Dezani M. (1983) \"A filter lambda model and the completeness of type assignement\" J. Symb. Lcgic 48, 4, 931\u2013940.","journal-title":"J. Symb. Lcgic"},{"key":"7_CR5","unstructured":"Barendregt H., Longo G. (1980) \"Equality of \u03bb-terms in the model T\u03c9\" in To H.B. Curry: essays in Combinatory Logic, \u03bb-calculus and formalism (Hindley, Seldin eds) Academic Press."},{"key":"7_CR6","unstructured":"Barendregt H., Longo G. (1982) \"Recursion theoretic operators and morphisms of numbered sets\" Fund. Math., CXIX, 49\u201362."},{"key":"7_CR7","unstructured":"Coppo M. (1983) \"Completeness of Type Assignment in continuous lambdamodels\" Teor. Comp. Sci. (to appear)."},{"key":"7_CR8","first-page":"45","volume":"27","author":"M. Coppo","year":"1981","unstructured":"Coppo M., Dezani M., Venneri B. (1981) \"Functional character of solvable terms\" ZML, 27, 45\u201358.","journal-title":"ZML"},{"key":"7_CR9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(76)90029-3","volume":"2","author":"H. Egli","year":"1976","unstructured":"Egli H., Constable R. (1976) \"Computability concepts for programming languages semantics\" Theor. Comp. Sci. 2, 133\u2013145.","journal-title":"Theor. Comp. Sci."},{"issue":"4","key":"7_CR10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF02219096","volume":"11","author":"Y. Ershov","year":"1972","unstructured":"Ershov Yu.L. (1972) \"Computable functionals of finite type\" Algebra and Logic 11, 4, 367\u2013437.","journal-title":"Algebra and Logic"},{"issue":"4","key":"7_CR11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/BF01463138","volume":"13","author":"Y. Ershov","year":"1974","unstructured":"Ershov Yu.L. (1974) \"Maximal and everywhere defined functionals\" Algebra and Logic 13, 4, 374\u2013397.","journal-title":"Algebra and Logic"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Ershov Yu.L. (1976) \"Model C of the continuous functionals\" Logic Coll. 76 (Gandy, Hyland eds.), North-Holland.","DOI":"10.1016\/S0049-237X(09)70439-2"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Gandy R., Hyland M. (1976) \"Computable and recursively countable functions of higher type\" Logic Coll. '76 (Gandy, Hyland eds), North-Holland.","DOI":"10.1016\/S0049-237X(09)70437-9"},{"key":"7_CR14","unstructured":"Gordon M. (1973) \"Evaluation and denotation of pure LISP programs\" Ph. D. Thesis, Edinburgh."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"Gordon M., Milner R., Wadsworth C. (1979) Edinburgh LCF LNCS-78, Springer-Verlag.","DOI":"10.1007\/3-540-09724-4"},{"key":"7_CR16","volume-title":"Dominical Categories and Recursion Theory","author":"A. Heller","year":"1983","unstructured":"Heller A. (1983) \"Dominical Categories and Recursion Theory\" Underground, New York."},{"key":"7_CR17","volume-title":"The countable functionals","author":"M. Hyland","year":"1976","unstructured":"Hyland M. (1976) \"The countable functionals\" Underground, Oxford."},{"key":"7_CR18","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0003-4843(79)90006-8","volume":"16","author":"M. Hyland","year":"1979","unstructured":"Hyland M. (1979) \"Filter spaces and the continuous functionals\" Ann. Math. Logic 16, 101\u2013143.","journal-title":"Ann. Math. Logic"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Kanda A. (1980) \"Fully effective solution of recursive domain equations\" Ph. D. Thesis, Warwick.","DOI":"10.1007\/3-540-09526-8_30"},{"key":"7_CR20","unstructured":"Kelley J. (1955) General topology Springer-Verlag."},{"key":"7_CR21","first-page":"1","volume":"91","author":"S.C. Kleene","year":"1959","unstructured":"Kleene S.C. (1959) \"Recursive functionals and quantifiers of finite type I\" Trans. A.M.S. 91, 1\u201352.","journal-title":"Trans. A.M.S."},{"key":"7_CR22","unstructured":"Kleene S.C. (1959a) \"Countable functionals\" in Constructivity in Mathematics (Heyting ed.), North-Holland."},{"key":"7_CR23","unstructured":"Kreisel G. (1959) \"Interpretation of Analysis by means of functionals of finite type\" in Constructivity in Mathematics (Heyting ed.), North-Holland."},{"key":"7_CR24","unstructured":"Kuratowski C. (1952) Topologie, vol. 1, Warsaw."},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0168-0072(83)90030-1","volume":"24","author":"G. Longo","year":"1983","unstructured":"Longo G. (1983) \"Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms\" Ann. Pure Applied Logic (formerly: Ann. Math. Logic), 24, 153\u2013188.","journal-title":"Ann. Pure Applied Logic"},{"key":"7_CR26","unstructured":"Longo G. (1984) \"Continuous structures and analytic methods in Computer Science\" Proceedings CAAP (Courcelle ed.), Cambridge University Press."},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Longo G., Moggi E. (1983) \"The Hereditary Effective Partial Functionals and Recursion Theory in Higher Types\" J. Symb. Logic (to appear).","DOI":"10.2307\/2274281"},{"key":"7_CR28","doi-asserted-by":"crossref","unstructured":"Longo G., Moggi E. (1984 an) \"Cartesian Closed Categories and partial morphisms for effective type structures I\" Symp. Semantics Data Types LNCS, Springer-Verlag (to appear).","DOI":"10.1007\/3-540-13346-1_12"},{"key":"7_CR29","doi-asserted-by":"crossref","unstructured":"Longo G., Moggi E. (1984 pr) \"G\u00f6del-numberings, principal morphisms, combinatory algebras\" MFCS '84 (Chytil ed.) LNCS, Springer-Verlag.","DOI":"10.1007\/BFb0030322"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Mac Lane S. (1971) Categories for the Working Mathematician, Springer-Verlag.","DOI":"10.1007\/978-1-4612-9839-7"},{"key":"7_CR31","unstructured":"Milne R. (1974) \"The formal semantics of computer languages and their implementations\" Ph. D. Thesis, Cambridge."},{"key":"7_CR32","unstructured":"Moschavakis Y. (1963) \"Recursive analysis\" Ph. D. Dissertation, Madison."},{"key":"7_CR33","doi-asserted-by":"crossref","unstructured":"Normann D. (1980) Recursion on the countable functionals LNM 811, Springer-Verlag.","DOI":"10.1007\/BFb0098600"},{"key":"7_CR34","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"Plotkin G. (1977) \"LCF considered as a programming language\" Theor. Comp. Sci. 5, 223\u2013255.","journal-title":"Theor. Comp. Sci."},{"key":"7_CR35","unstructured":"Plotkin G. (1980) \"Lambda-definability in the full type hierarchy\" in To H.B. Curry: essays... (Hindley, Seldin eds), Academic Press."},{"key":"7_CR36","volume-title":"The category-theoretic solution of recursive domain equations","author":"G. Plotkin","year":"1982","unstructured":"Plotkin G., Smyth M. (1982) \"The category-theoretic solution of recursive domain equations\" C.S. Dept., Edinburgh."},{"key":"7_CR37","unstructured":"Rogers H. (1967) Theory of recursive functions and effective computability, McGraw-Hill."},{"key":"7_CR38","volume-title":"Spazi di filtri ed operatori di Turing","author":"F. Ruggeri","year":"1984","unstructured":"Ruggeri F. (1984) \"Spazi di filtri ed operatori di Turing\" Tesi di Laurea in Matematica, Pisa."},{"key":"7_CR39","first-page":"113","volume":"23","author":"B. Scarpellini","year":"1971","unstructured":"Scarpellini B. (1971) \"A model for bar recursion of higher types\" Comp. Math. 23, 113\u2013153.","journal-title":"Comp. Math."},{"key":"7_CR40","unstructured":"Scott D.S. (1969) \"A theory of computable functions in higher types\" Seminar Notes, University of Oxford."},{"key":"7_CR41","unstructured":"Scott D.S. (1970) \"Outline of a mathematical theory of computation\" IV Annual Princeton Conf. on Info. Syst. and Sci., 169\u2013176."},{"key":"7_CR42","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","volume":"5","author":"D.S. Scott","year":"1976","unstructured":"Scott D.S. (1976) \"Data types as lattices\" SIAM J. Comp., 5, 522\u2013587.","journal-title":"SIAM J. Comp."},{"key":"7_CR43","doi-asserted-by":"crossref","unstructured":"Scott D.S. (1982) \"Some ordered sets in Computer Science\" in Ordered sets (Rival ed.), Reidel.","DOI":"10.1007\/978-94-009-7798-3_22"},{"key":"7_CR44","unstructured":"Spreen D. (1983) \"Effective operators in a topological setting\" Logic Coll. 83, LNM, Springer-Verlag (to appear)."},{"key":"7_CR45","unstructured":"Statman R. (1980) \"Completeness, invariance and lambda-definability\" J. Symb. Logic (to appear)."},{"key":"7_CR46","volume-title":"A solution for the definability problem for deterministic domains","author":"T. Steicher","year":"1984","unstructured":"Steicher T. (1984) \"A solution for the definability problem for deterministic domains\" Inst. Math. J. Kepler Univ., Linz."},{"key":"7_CR47","doi-asserted-by":"crossref","unstructured":"Wand M. (1983) \"Loops in Combinator-Based Compilers\" Info. Contr. (to appear).","DOI":"10.1016\/S0019-9958(83)80041-2"},{"key":"7_CR48","doi-asserted-by":"crossref","unstructured":"Wand M. (1984) \"A Types-as-Sets Semantics for Milner-Style Polymorphism\" 11th ACM Symp. Principle of Progr. Lang..","DOI":"10.1145\/800017.800527"},{"key":"7_CR49","doi-asserted-by":"crossref","unstructured":"Weihrauch K., Sch\u00e4fer G. (1983) \"Admissible representation of effective cpo's\" Theor. Comp. Sci. (to appear).","DOI":"10.1016\/0304-3975(83)90083-X"},{"key":"7_CR50","unstructured":"Giannini P., Longo G. (1982) \"Effectively given domains and lambda-calculus semantics\" Info. Contr. (to appear)."},{"key":"7_CR51","unstructured":"Longo G., Martini S. (1984) \"Higher type computability, P\u03c9 and the completeness of type assignement\" (Prelim. incomplete version: Proc. STACS, LNCS, Springer-Verlag)."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1984"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0030292.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T04:49:54Z","timestamp":1683348594000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0030292"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540133720"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/bfb0030292","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/bfb0030285","asserted-by":"object"}]},"subject":[]}}