Matches in SemOpenAlex for { <https://semopenalex.org/work/W2943029224> ?p ?o ?g. }
- W2943029224 abstract "Abstract We exploit the idea of proving properties of an abstract machine by using a corresponding semantic artefact better suited to their proof. The abstract machine is an improved version of Pierre Crégut’s full-reducing Krivine machine KN. The original version works with closed terms of the pure lambda calculus with de Bruijn indices. The improved version reduces in similar fashion but works on closures where terms may be open. The corresponding semantic artefact is a structural operational semantics of a calculus of closures whose reduction relation is purposely a reduction strategy. As shown in previous work, improved KN and the structural operational semantics ‘correspond’, i.e. both artefacts realise the same reduction strategy. In this paper, we prove in the calculus of closures that the reduction strategy simulates in lockstep (at every reduction step) the complete and standard normal-order strategy (i.e. leftmost reduction to normal form) of the pure lambda calculus. The simulation is witnessed by a substitution function from closures of the closure calculus to pure terms of the pure lambda calculus. Thus, KN also simulates normal-order in lockstep by the correspondence. This result is stronger than the known proof that KN is complete, for in the pure lambda calculus there are complete but non-standard strategies. The lockstep simulation proof consists of straightforward structural inductions, thanks to three properties of the closure calculus we call ‘index alignment’, ‘parameters-as-levels’ and ‘balanced derivations’. The first two come from KN. Thanks to these properties, a proof in a calculus of closures involving de Bruijn indices and de Bruijn levels is unproblematic. There is no lexical adjustment at binding lookup, on-the-fly alpha-conversion or recursive traversals of the term to deal with bound and free variables as in other calculi. This paper contributes to the framework for environment machines of Biernacka and Danvy a full-reducing open-terms closure calculus, its corresponding abstract machine, and a lockstep simulation proof via a substitution function." @default.
- W2943029224 created "2019-05-09" @default.
- W2943029224 creator A5021834978 @default.
- W2943029224 creator A5040315866 @default.
- W2943029224 date "2019-01-01" @default.
- W2943029224 modified "2023-09-26" @default.
- W2943029224 title "The full-reducing Krivine abstract machine KN simulates pure normal-order reduction in lockstep: A proof via corresponding calculus" @default.
- W2943029224 cites W1488897269 @default.
- W2943029224 cites W1529760921 @default.
- W2943029224 cites W1589216209 @default.
- W2943029224 cites W1606543423 @default.
- W2943029224 cites W1750600100 @default.
- W2943029224 cites W1965143747 @default.
- W2943029224 cites W1987185889 @default.
- W2943029224 cites W1992452788 @default.
- W2943029224 cites W1994350081 @default.
- W2943029224 cites W2007757832 @default.
- W2943029224 cites W2016326123 @default.
- W2943029224 cites W2019676725 @default.
- W2943029224 cites W2022873112 @default.
- W2943029224 cites W2025431400 @default.
- W2943029224 cites W2031190840 @default.
- W2943029224 cites W2040871029 @default.
- W2943029224 cites W2077444071 @default.
- W2943029224 cites W2091657052 @default.
- W2943029224 cites W2095631859 @default.
- W2943029224 cites W2117692498 @default.
- W2943029224 cites W2134776161 @default.
- W2943029224 cites W2141591284 @default.
- W2943029224 cites W2147478629 @default.
- W2943029224 cites W2163285555 @default.
- W2943029224 cites W2252719495 @default.
- W2943029224 cites W2477365581 @default.
- W2943029224 cites W2483114314 @default.
- W2943029224 cites W2502963211 @default.
- W2943029224 cites W2568721247 @default.
- W2943029224 cites W2801769268 @default.
- W2943029224 cites W398758961 @default.
- W2943029224 cites W4236324644 @default.
- W2943029224 cites W4248352158 @default.
- W2943029224 cites W4249903311 @default.
- W2943029224 doi "https://doi.org/10.1017/s0956796819000017" @default.
- W2943029224 hasPublicationYear "2019" @default.
- W2943029224 type Work @default.
- W2943029224 sameAs 2943029224 @default.
- W2943029224 citedByCount "3" @default.
- W2943029224 countsByYear W29430292242020 @default.
- W2943029224 countsByYear W29430292242021 @default.
- W2943029224 crossrefType "journal-article" @default.
- W2943029224 hasAuthorship W2943029224A5021834978 @default.
- W2943029224 hasAuthorship W2943029224A5040315866 @default.
- W2943029224 hasConcept C111335779 @default.
- W2943029224 hasConcept C11413529 @default.
- W2943029224 hasConcept C118615104 @default.
- W2943029224 hasConcept C135790938 @default.
- W2943029224 hasConcept C146834321 @default.
- W2943029224 hasConcept C156325763 @default.
- W2943029224 hasConcept C162324750 @default.
- W2943029224 hasConcept C184337299 @default.
- W2943029224 hasConcept C199343813 @default.
- W2943029224 hasConcept C199360897 @default.
- W2943029224 hasConcept C2524010 @default.
- W2943029224 hasConcept C2777686260 @default.
- W2943029224 hasConcept C33923547 @default.
- W2943029224 hasConcept C34447519 @default.
- W2943029224 hasConcept C41008148 @default.
- W2943029224 hasConcept C71924100 @default.
- W2943029224 hasConcept C88977235 @default.
- W2943029224 hasConceptScore W2943029224C111335779 @default.
- W2943029224 hasConceptScore W2943029224C11413529 @default.
- W2943029224 hasConceptScore W2943029224C118615104 @default.
- W2943029224 hasConceptScore W2943029224C135790938 @default.
- W2943029224 hasConceptScore W2943029224C146834321 @default.
- W2943029224 hasConceptScore W2943029224C156325763 @default.
- W2943029224 hasConceptScore W2943029224C162324750 @default.
- W2943029224 hasConceptScore W2943029224C184337299 @default.
- W2943029224 hasConceptScore W2943029224C199343813 @default.
- W2943029224 hasConceptScore W2943029224C199360897 @default.
- W2943029224 hasConceptScore W2943029224C2524010 @default.
- W2943029224 hasConceptScore W2943029224C2777686260 @default.
- W2943029224 hasConceptScore W2943029224C33923547 @default.
- W2943029224 hasConceptScore W2943029224C34447519 @default.
- W2943029224 hasConceptScore W2943029224C41008148 @default.
- W2943029224 hasConceptScore W2943029224C71924100 @default.
- W2943029224 hasConceptScore W2943029224C88977235 @default.
- W2943029224 hasLocation W29430292241 @default.
- W2943029224 hasOpenAccess W2943029224 @default.
- W2943029224 hasPrimaryLocation W29430292241 @default.
- W2943029224 hasRelatedWork W1965143747 @default.
- W2943029224 hasRelatedWork W1973094556 @default.
- W2943029224 hasRelatedWork W2007217566 @default.
- W2943029224 hasRelatedWork W2122095407 @default.
- W2943029224 hasRelatedWork W2141591284 @default.
- W2943029224 hasRelatedWork W2148586282 @default.
- W2943029224 hasRelatedWork W2258460173 @default.
- W2943029224 hasRelatedWork W2475004632 @default.
- W2943029224 hasRelatedWork W2943029224 @default.
- W2943029224 hasRelatedWork W3177460997 @default.
- W2943029224 isParatext "false" @default.
- W2943029224 isRetracted "false" @default.