{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:54:01Z","timestamp":1776891241066,"version":"3.51.2"},"reference-count":7,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"4","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"unspecified","delay-in-days":4786,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1995,10]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We introduce a \u03bb-calculus notation which enables us to detect in a term, more \u03b2-redexes than in the usual notation. On this basis, we define an extended \u03b2-reduction which is yet a subrelation of conversion. The Church Rosser property holds for this extended reduction. Moreover, we show that we can transform generalised redexes into usual ones by a process called \u2018term reshuffling\u2019.<\/jats:p>","DOI":"10.1017\/s0956796800001507","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:11:23Z","timestamp":1226056283000},"page":"637-651","source":"Crossref","is-referenced-by-count":8,"title":["Refining reduction in the lambda calculus"],"prefix":"10.46298","volume":"5","author":[{"given":"Fairouz","family":"Kamareddine","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rob","family":"Nederpelt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S0956796800001507_ref006","doi-asserted-by":"crossref","unstructured":"Nederpelt R. P. (1973) Strong normalisation in a typed lambda calculus with lambda structured types. PhD thesis, Eindhoven University of Technology, Department of Mathematics and Computer Science. (Also in Nederpelt R. P. , Geuvers J. H. and de Vrijer R. C. , eds. (1994) Selected Papers on Automath. North Holland.)","DOI":"10.1016\/S0049-237X(08)70217-9"},{"key":"S0956796800001507_ref002","first-page":"131","volume-title":"Logical Environments","author":"de Bruijn","year":"1993"},{"key":"S0956796800001507_ref005","unstructured":"Kamareddine F. and Nederpelt R. P. (1995) The beauty of the \u03bb-calculus. In preparation."},{"key":"S0956796800001507_ref003","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054193000146"},{"key":"S0956796800001507_ref007","doi-asserted-by":"publisher","DOI":"10.1017\/S095679680000006X"},{"key":"S0956796800001507_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90001-0"},{"key":"S0956796800001507_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00127-5"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800001507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:18:07Z","timestamp":1776889087000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800001507\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,10]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1995,10]]}},"alternative-id":["S0956796800001507"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800001507","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,10]]}}}