{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:37:50Z","timestamp":1761590270301,"version":"build-2065373602"},"reference-count":42,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,1,1]],"date-time":"2003-01-01T00:00:00Z","timestamp":1041379200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3850,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["The Journal of Logic and Algebraic Programming"],"published-print":{"date-parts":[[2003,1]]},"DOI":"10.1016\/s1567-8326(02)00016-4","type":"journal-article","created":{"date-parts":[[2002,10,11]],"date-time":"2002-10-11T00:01:59Z","timestamp":1034294519000},"page":"65-107","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Revisiting the notion of function"],"prefix":"10.1016","volume":"54","author":[{"given":"Fairouz","family":"Kamareddine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Twan","family":"Laan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"Nederpelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/S1567-8326(02)00016-4_BIB1","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1017\/S0956796800000186","article-title":"Explicit substitutions","volume":"1","author":"Abadi","year":"1991","journal-title":"J. Funct. Programming"},{"year":"1992","series-title":"Handbook of Logic in Computer Science, vol. 2 Background: Computational structures","key":"10.1016\/S1567-8326(02)00016-4_BIB2"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB3","article-title":"The lambda calculus: its syntax and semantics","volume":"vol. 103","author":"Barendregt","year":"1984"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB4","unstructured":"H.P. Barendregt, Lambda calculi with types, In Ref. [2, pp. 117\u2013309]"},{"issue":"5","key":"10.1016\/S1567-8326(02)00016-4_BIB5","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1017\/S0956796800001945","article-title":"\u03bb\u03c5, a calculus of explicit substitutions which preserves strong normalisation","volume":"6","author":"Benaissa","year":"1996","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB6","unstructured":"L.S. van Benthem Jutting, Checking Landau\u2019s \u201cGrundlagen\u201d in the Automath system, Ph.D. Thesis, Eindhoven University of Technology, 1977. Published as Mathematical Centre Tracts no. 83, Amsterdam, Mathematisch Centrum, 1979"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB7","unstructured":"R. Bloo, Preservation of termination for explicit substitutions, Ph.D. Thesis, Eindhoven University of Technology, 1997"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S096012950000325X","article-title":"Explicit substitutions in the Barendregt cube","volume":"11","author":"Bloo","year":"2001","journal-title":"Math. Struct. Comput. Sci."},{"issue":"2","key":"10.1016\/S1567-8326(02)00016-4_BIB9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1006\/inco.1996.0041","article-title":"The Barendregt cube with definitions and generalised reduction","volume":"126","author":"Bloo","year":"1996","journal-title":"Inform. and Comput."},{"key":"10.1016\/S1567-8326(02)00016-4_BIB10","doi-asserted-by":"crossref","unstructured":"N.G. de Bruijn, The mathematical language AUTOMATH, its usage and some of its extensions, in: M. Laudet, D. Lacombe, M. Schuetzenberger (Eds.), Proceedings of the Symposium on Automatic Demonstration, IRIA, Versailles, 1968, pp. 29\u201361, Springer, Berlin, 1970, Lecture Notes in Mathematics 125; also in Ref. [34, pp. 73\u2013100]","DOI":"10.1007\/BFb0060623"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB11","unstructured":"N.G. de Bruijn, Reflections on Automath, Eindhoven University of Technology, 1990. Also in Ref. [34, pp.\u00a0201\u2013228]"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.2307\/1968337","article-title":"A set of postulates for the foundation of logic (1)","volume":"33","author":"Church","year":"1932","journal-title":"Ann. Math."},{"key":"10.1016\/S1567-8326(02)00016-4_BIB13","doi-asserted-by":"crossref","first-page":"839","DOI":"10.2307\/1968702","article-title":"A set of postulates for the foundation of logic (2)","volume":"34","author":"Church","year":"1933","journal-title":"Ann. Math."},{"key":"10.1016\/S1567-8326(02)00016-4_BIB14","doi-asserted-by":"crossref","first-page":"56","DOI":"10.2307\/2266170","article-title":"A formulation of the simple theory of types","volume":"5","author":"Church","year":"1940","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB15","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0890-5401(88)90005-3","article-title":"The calculus of constructions","volume":"76","author":"Coquand","year":"1988","journal-title":"Inform. and Comput."},{"year":"1958","series-title":"Combinatory Logic I. Studies in Logic and the Foundations of MathematicNorth-Holland","author":"Curry","key":"10.1016\/S1567-8326(02)00016-4_BIB16"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB17","unstructured":"G. Frege, Begriffsschrift, eine der arithmetischen nachgebildete Formelsprache des reinen Denkens, Nebert, Halle, 1879. Also in Ref. [21, pp. 1\u201382]"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB18","unstructured":"J.H. Geuvers. Logics and type systems, Ph.D. Thesis, Catholic University of Nijmegen, 1993"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB19","unstructured":"J.-Y. Girard, Interpr\u00e9tation fonctionelle et \u00e9limination des coupures dans l\u2019arithm\u00e9tique d\u2019ordre sup\u00e9rieur, Ph.D. Thesis, Universit\u00e9 Paris VII, 1972"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB20","series-title":"in: Proceedings of the Second Symposium on Logic in Computer Science","first-page":"194","article-title":"A framework for defining logics","author":"Harper","year":"1987"},{"year":"1967","series-title":"From Frege to G\u00f6del: A Source Book in Mathematical Logic, 1879\u20131931","key":"10.1016\/S1567-8326(02)00016-4_BIB21"},{"year":"1986","series-title":"Introduction to Combinators and \u03bb-Calculus Vol. 1, London Mathematical Society Student Texts","author":"Hindley","key":"10.1016\/S1567-8326(02)00016-4_BIB22"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB23","unstructured":"W.A. Howard, The formulas-as-types notion of construction, In Ref. [40, pp. 479\u2013490]"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB24","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0168-0072(98)00019-0","article-title":"On \u03c0-conversion in the \u03bb-cube and the combination with abbreviations","volume":"97","author":"Kamareddine","year":"1999","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB25","series-title":"in: Proceedings of the Fifth International Symposium on Functional and Logic Programming, FLOPS 2001","first-page":"375","article-title":"Refining the Barendregt cube using parameters","author":"Kamareddine","year":"2001"},{"issue":"2","key":"10.1016\/S1567-8326(02)00016-4_BIB26","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1017\/S0956796800001672","article-title":"Canonical typing and \u03a0-conversion in the barendregt cube","volume":"6","author":"Kamareddine","year":"1996","journal-title":"J. Funct. Programming"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB27","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(95)00101-8","article-title":"A useful \u03bb-notation","volume":"155","author":"Kamareddine","year":"1996","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S1567-8326(02)00016-4_BIB28","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BFb0026813","article-title":"A \u03bb-calculus \u00e0 la de Bruijn with explicit substitution","author":"Kamareddine","year":"1995","journal-title":"Programming Language Implementation and the Logic of Programs PLILP"},{"issue":"3","key":"10.1016\/S1567-8326(02)00016-4_BIB29","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1093\/logcom\/10.3.349","article-title":"Relating the \u03bb\u03c3- and \u03bbs-styles of explicit substitutions","volume":"10","author":"Kamareddine","year":"2000","journal-title":"J. Logic and Comput."},{"key":"10.1016\/S1567-8326(02)00016-4_BIB30","unstructured":"T. Laan, The evolution of type theory in logic and mathematics, Ph.D. Thesis, Eindhoven University of Technology, 1997"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB31","doi-asserted-by":"crossref","DOI":"10.1093\/logcom\/11.4.545","article-title":"Parameters for first order logic","author":"Laan","year":"2001","journal-title":"Logic and Comput."},{"key":"10.1016\/S1567-8326(02)00016-4_BIB32","unstructured":"G. Longo, E. Moggi, Constructive natural deduction and its modest interpretation. Technical Report CMU-CS-88-131, Carnegie Mellono University, Pittsburgh, USA, 1988"},{"year":"1990","series-title":"Definition of Standard ML","author":"Milner","key":"10.1016\/S1567-8326(02)00016-4_BIB33"},{"volume":"133","year":"1994","key":"10.1016\/S1567-8326(02)00016-4_BIB34"},{"year":"1987","series-title":"The Implementation of Functional Programming Languages","author":"Peyton-Jones","key":"10.1016\/S1567-8326(02)00016-4_BIB35"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB36","article-title":"Henk: a typed intermediate language","author":"Peyton-Jones","year":"1997","journal-title":"Types in Compilation Workshop"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB37","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1016\/0890-5401(92)90028-E","article-title":"Strictness analysis via abstract interpretation for recursively defined types","volume":"99","author":"Renardel de Lavalette","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S1567-8326(02)00016-4_BIB38","series-title":"Towards a Theory of Type Structure, vol. 19, Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1007\/3-540-06859-7_148","author":"Reynolds","year":"1974"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB39","doi-asserted-by":"crossref","unstructured":"M. Sch\u00f6nfinkel, \u00dcber die Bausteine der mathematischen Logik. Mathematische Annalen, 92 (1924) 305\u2013316, Also in Ref. [21, pp. 355\u2013366]","DOI":"10.1007\/BF01448013"},{"year":"1980","series-title":"To H.B. Curry: Essays on Combinatory Logic Lambda Calculus and Formalism","key":"10.1016\/S1567-8326(02)00016-4_BIB40"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB41","unstructured":"M.T. Stefanova, Properties of typing systems, Ph.D. Thesis, University of Nijmegen, 1999"},{"key":"10.1016\/S1567-8326(02)00016-4_BIB42","unstructured":"A.N. Whitehead, B. Russell, Principia Mathematica, volume I, II, III. Cambridge University Press, 1910,1912,19131, 1925,1925,19272. All references are to the first volume, unless otherwise stated"}],"container-title":["The Journal of Logic and Algebraic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832602000164?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1567832602000164?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T18:33:46Z","timestamp":1761590026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1567832602000164"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,1]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2003,1]]}},"alternative-id":["S1567832602000164"],"URL":"https:\/\/doi.org\/10.1016\/s1567-8326(02)00016-4","relation":{},"ISSN":["1567-8326"],"issn-type":[{"type":"print","value":"1567-8326"}],"subject":[],"published":{"date-parts":[[2003,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Revisiting the notion of function","name":"articletitle","label":"Article Title"},{"value":"The Journal of Logic and Algebraic Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S1567-8326(02)00016-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}