Filters








239,600 Hits in 2.4 sec

Strictness optimization for graph reduction machines (why id might not be strict)

Marcel Beemster
<span title="1994-09-01">1994</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4hplau6wtnhnfnqt2t7vbri6vm" style="color: black;">ACM Transactions on Programming Languages and Systems</a> </i> &nbsp;
However, this argument is already reduced, so reduction proceeds as Reentering shown. The spineless machines are more interesting.  ...  An implementor of lazy graph reduction can choose a leaner reduction machine with aggressive take and more complicated code genera- tion, or choose an evaluator that can evaluate any kind of  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/186025.186040">doi:10.1145/186025.186040</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q4emkta32vgxblaqqrfeisnhnu">fatcat:q4emkta32vgxblaqqrfeisnhnu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722050705/https://pure.uva.nl/ws/files/2850606/206_2701y.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d5/ca/d5cab5670107f6b8cbe41b12d32f0e8dbc995c31.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/186025.186040"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines [chapter]

Małgorzata Biernacka, Olivier Danvy
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Acknowledgments: The authors are grateful to the anonymous reviewers for their comments, and to Will Clinger for extra precisions.  ...  Krivine machine for call by name and the CEK machine for call by value [3] . plicit representation of the reduction context.  ...  the reductions in the language, the last three -the propagation This machine is the same one as in the companion paper [11] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04164-8_10">doi:10.1007/978-3-642-04164-8_10</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/nfk74qvvcbhkxk2ruxgecskogq">fatcat:nfk74qvvcbhkxk2ruxgecskogq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829050138/http://www.schemeworkshop.org/2008/paper4.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ba/37/ba374a28af09de2b858218ce61505622d8d4657a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-04164-8_10"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Using compiler snippets to exploit parallelism on heterogeneous hardware: a Java reduction case study

Juan Fumero, Christos Kotselidis
<span title="">2018</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6y3m32grtnfktkp2oo6oqjbvta" style="color: black;">Proceedings of the 10th ACM SIGPLAN International Workshop on Virtual Machines and Intermediate Languages - VMIL 2018</a> </i> &nbsp;
However, for the Java programming language, little work has been done for automatically compiling and exploiting reductions in Java applications on GPUs.  ...  Reductions are one of the most common parallel skeletons. Many programming frameworks have been proposed for accelerating reduction operations on heterogeneous hardware.  ...  Authors would also like to thank David Leopoldseder and Foivos Zakkak for fruitful discussions and feedback.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3281287.3281292">doi:10.1145/3281287.3281292</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/oopsla/FumeroK18.html">dblp:conf/oopsla/FumeroK18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/d2gnnf3jojhylcljratwtc3qw4">fatcat:d2gnnf3jojhylcljratwtc3qw4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427105543/https://www.research.manchester.ac.uk/portal/files/77300657/main.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/b7/42/b742dcb953cdd3e4f6e06ace685b741f08d3a752.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3281287.3281292"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

The dutch parallel reduction machine project

H.P. Barendregt, M.C.J.D. Van Eekelen, M.J. Plasmeijer, P.H. Hartel, L.O. Hertzberger, W.G. Vree
<span title="">1987</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/idqeix2ukbd5fbgjjdkjmaj3ka" style="color: black;">Future generations computer systems</a> </i> &nbsp;
Is it possible and realistic to construct an efficient parallel reduction machine?  ...  The present paper gives an outline o f the problem s concerning parallel reduction machines and o f our research towards their solutions.  ...  Acknowledgements The following people of the Dutch parallel reduction machine project have made valuable  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0167-739x(87)90030-6">doi:10.1016/0167-739x(87)90030-6</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5eqp3qltnbhsletjpy6qe5x2rq">fatcat:5eqp3qltnbhsletjpy6qe5x2rq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210716210611/https://repository.ubn.ru.nl/bitstream/handle/2066/17256/1/13273.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c9/07/c907040e2b726e0a41c3c0cd69537b1644f296d3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/0167-739x(87)90030-6"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

Automating Derivations of Abstract Machines from Reduction Semantics: [chapter]

Filip Sieczkowski, Małgorzata Biernacka, Dariusz Biernacki
<span title="">2011</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
We present a generic formalization of the refocusing transformation for functional languages in the Coq proof assistant.  ...  The refocusing technique, due to Danvy and Nielsen, allows for mechanical transformation of an evaluator implementing a reduction semantics into an equivalent abstract machine via a succession of simple  ...  Acknowledgements We would like to thank Olivier Danvy and the anonymous reviewers of IFL'10 for numerous useful comments on the presentation of this work.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-24276-2_5">doi:10.1007/978-3-642-24276-2_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/7vs2f2krbva4reubcx3ylbvtyu">fatcat:7vs2f2krbva4reubcx3ylbvtyu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170810160516/http://www.ii.uni.wroc.pl/~dabi/publications/IFL10/sieczkowski-al-ifl10.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/3a/60/3a60a7c3536198164b229fcc82f24dadf90da92a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-24276-2_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Efficient compilation of lazy evaluation

Thomas Johnsson
<span title="2004-04-01">2004</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/xu5bk2lj5rbdxlx6222nw7tsxi" style="color: black;">SIGPLAN notices</a> </i> &nbsp;
for logic programming languages e.g.  ...  With the G-machine, we sought to describe and compile the reduction rules implied by such combinators into reasonable machine code.  ...  for logic programming languages e.g.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/989393.989409">doi:10.1145/989393.989409</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6p4irwgn7nhlbflwava756omlu">fatcat:6p4irwgn7nhlbflwava756omlu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217184250/https://static.aminer.org/pdf/20170130/pdfs/pldi/okphr2jqdxgzqxuhmkafsacwevdfbtow.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/29/1b/291bbb4a6b8a24caf8714615c49820c4efed8219.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/989393.989409"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Semantics-directed code generation

Andrew W. Appel
<span title="">1985</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2qaxtqe2rfgjnfefqcokcnzelq" style="color: black;">Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL &#39;85</a> </i> &nbsp;
As in a denotational semantics for a programming language, states are represented explicitly (as internal nodes in the graph), and there are no side-effects implicit in the graph.  ...  Each transformation corresponds to a machine-operation; the reducer emits one line of assembly code as it performs each reduction:  ...  Sections 5, 6, and 7 describe the reductions which are useful for compiling conventional programming languages. Section 8 discusses the algorithm for applying these reductions.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/318593.318661">doi:10.1145/318593.318661</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/popl/Appel85.html">dblp:conf/popl/Appel85</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2b5x3irjofaqtg67tsuhi2wx5y">fatcat:2b5x3irjofaqtg67tsuhi2wx5y</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181217104328/http://www.cs.princeton.edu/~appel/papers/sdcg.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/55/a5/55a5c8d8c76e37a8cf394f4ca4a3bca32c9ef4cb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/318593.318661"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

On graph rewriting, reduction, and evaluation in the presence of cycles

Ian Zerny
<span title="">2013</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/t26kxee64ne4xcsmauoqewjwp4" style="color: black;">Higher-Order and Symbolic Computation</a> </i> &nbsp;
We inter-derive two prototypical styles of graph reduction: reduction machinesà la Turner and graph rewriting systemsà la Barendregt et al. To this end, we adapt Danvy et al.'  ...  We also outline how to inter-derive a third style of graph reduction: a graph evaluator.  ...  Thanks to Olivier Danvy for his supervision and for his course on functional programming at Aarhus University from which this work originates.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10990-014-9103-9">doi:10.1007/s10990-014-9103-9</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bvf5acjvebdtdnhan2dkwmxdkq">fatcat:bvf5acjvebdtdnhan2dkwmxdkq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170829185954/http://www.zerny.dk/zerny-tfp09.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/7c/40/7c4042fe0c86e233bb7bf089505cc1f36674bafc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s10990-014-9103-9"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Comparing Reductions to NP-Complete Sets [chapter]

John M. Hitchcock, A. Pavan
<span title="">2006</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
for NP but not Turing-complete. (3) Every problem that is many-one complete for NP is complete under length-increasing reductions that are computed by polynomial-size circuits.  ...  is a problem that is Turingcomplete for NP but not truth-table-complete. (2) Strong nondeterministic reductions are more powerful than deterministic reductions: there is a problem that is SNP-complete  ...  We also thank the anonymous reviewers from ICALP 2006 for their comments on a preliminary version of this paper. We thank Lance Fortnow for the simpler proof of Theorem 5.1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11786986_41">doi:10.1007/11786986_41</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5pyktz7j4fcxfmigvsndvi7y5q">fatcat:5pyktz7j4fcxfmigvsndvi7y5q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003032337/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/c35/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDg5MDU0MDEwNjAwMTI1OA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/b4/31b4713f6497dea59bc870f37fa5e62376b8995a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11786986_41"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Comparing reductions to NP-complete sets

John M. Hitchcock, A. Pavan
<span title="">2007</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/joe2ngto45hbnl3pncnesnq344" style="color: black;">Information and Computation</a> </i> &nbsp;
for NP but not Turing-complete. (3) Every problem that is many-one complete for NP is complete under length-increasing reductions that are computed by polynomial-size circuits.  ...  is a problem that is Turingcomplete for NP but not truth-table-complete. (2) Strong nondeterministic reductions are more powerful than deterministic reductions: there is a problem that is SNP-complete  ...  We also thank the anonymous reviewers from ICALP 2006 for their comments on a preliminary version of this paper. We thank Lance Fortnow for the simpler proof of Theorem 5.1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2006.10.005">doi:10.1016/j.ic.2006.10.005</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dv2zcp362bel3cu6v7kzxhbpey">fatcat:dv2zcp362bel3cu6v7kzxhbpey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171003032337/http://publisher-connector.core.ac.uk/resourcesync/data/elsevier/pdf/c35/aHR0cDovL2FwaS5lbHNldmllci5jb20vY29udGVudC9hcnRpY2xlL3BpaS9zMDg5MDU0MDEwNjAwMTI1OA%3D%3D.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/31/b4/31b4713f6497dea59bc870f37fa5e62376b8995a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ic.2006.10.005"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

An Investigation of Abadi and Cardelli's Untyped Calculus of Objects

Jacob Johannsen
<span title="2008-06-12">2008</span> <i title="Aarhus University Library"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/433eg2tipzegfkgt5m5cmv46zq" style="color: black;">BRICS Report Series</a> </i> &nbsp;
s syntactic correspondence to the reduction semantics, we also derive an abstract machines for this calculus. These two abstract machines are identical.  ...  s functional correspondence to the natural semantics, we derive an abstract machine for this calculus, and by applying Danvy et al.'  ...  provides a mechanism for proving equivalence between reduction semantics and abstract machine for the same language.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v15i6.21941">doi:10.7146/brics.v15i6.21941</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cdqmimu66zhlzk3ybpv7eb4rhy">fatcat:cdqmimu66zhlzk3ybpv7eb4rhy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180719155958/https://tidsskrift.dk/brics/article/download/21941/19366" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/53/6d/536d17b591b7f4626e2ce2e1b0c1400b3eb0db9a.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v15i6.21941"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A concrete framework for environment machines

Małgorzata Biernacka, Olivier Danvy
<span title="2007-12-01">2007</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/3kjjbv4edjbezl2w37ipy5lo5a" style="color: black;">ACM Transactions on Computational Logic</a> </i> &nbsp;
we methodically derive a series of environment machines from the specification of two one-step reduction strategies for the λ-calculus: normal order and applicative order.  ...  The derivation extends Danvy and Nielsen's refocusing-based construction of abstract machines with two new steps: one for coalescing two successive transitions into one, and the other for unfolding a closure  ...  Acknowledgments: Thanks are due to Mads Sig Ager, Dariusz Biernacki, Mayer Goldberg, Julia Lawall, Jan Midtgaard, Kevin Millikin, and Kristian Støvring for comments, and to Ulrich Kohlenbach for providing  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1297658.1297664">doi:10.1145/1297658.1297664</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ldjgznn3cvh5hiwwnavhd35izy">fatcat:ldjgznn3cvh5hiwwnavhd35izy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922060106/https://tidsskrift.dk/index.php/brics/article/download/21881/19308" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/37/ee37a00d49501d4c135bacb8807cb42bc1a4cd6d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1297658.1297664"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A Concrete Framework for Environment Machines

Malgorzata Biernacka, Olivier Danvy
<span title="2005-05-11">2005</span> <i title="Aarhus University Library"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/433eg2tipzegfkgt5m5cmv46zq" style="color: black;">BRICS Report Series</a> </i> &nbsp;
derive a series of environment machines from the specification of two one-step reduction strategies for the lambda-calculus: normal order and applicative order.  ...  The derivation extends Danvy and Nielsen's refocusing-based construction of abstract machines with two new steps: one for coalescing two successive transitions into one, and one for unfolding a closure  ...  Acknowledgments: Thanks are due to Mads Sig Ager, Dariusz Biernacki, Mayer Goldberg, Julia Lawall, Jan Midtgaard, Kevin Millikin, and Kristian Støvring for comments, and to Ulrich Kohlenbach for providing  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v12i15.21881">doi:10.7146/brics.v12i15.21881</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/deygynjytbhkpb6ueqv7jo2aw4">fatcat:deygynjytbhkpb6ueqv7jo2aw4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922060106/https://tidsskrift.dk/index.php/brics/article/download/21881/19308" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ee/37/ee37a00d49501d4c135bacb8807cb42bc1a4cd6d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v12i15.21881"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

A correspondence between type checking via reduction and type checking via evaluation

Ilya Sergey, Dave Clarke
<span title="">2012</span> <i title="Elsevier BV"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/5xfy4fcdxvcvdiybp6iqbffqc4" style="color: black;">Information Processing Letters</a> </i> &nbsp;
Different ways of representing type assignments are convenient for particular applications such as reasoning or implementation, but some kind of correspondence between them should be proven.  ...  ., we mechanically derive the correspondence between a reductionbased semantics for type-checking and a traditional one in the form of derivation rules, implemented as a recursive descent.  ...  We also thank the anonymous reviewers for the comments and especially for the suggestions on the cleanup and reorganization of the accompanying code.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2011.10.008">doi:10.1016/j.ipl.2011.10.008</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/e7ftm7x245emtdmqyofbjandkq">fatcat:e7ftm7x245emtdmqyofbjandkq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20171127084510/https://core.ac.uk/download/pdf/34510026.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0f/6c/0f6c099793a71ca34cfc2ba83ff98441bd824c6c.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1016/j.ipl.2011.10.008"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> elsevier.com </button> </a>

A Study of Syntactic and Semantic Artifacts and its Application to Lambda Definability, Strong Normalization, and Weak Normalization in the Presence of..

Johan Munk
<span title="2008-04-12">2008</span> <i title="Aarhus University Library"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/433eg2tipzegfkgt5m5cmv46zq" style="color: black;">BRICS Report Series</a> </i> &nbsp;
We give a new account of Felleisen and Hieb's syntactic theory of state, and of abstract machines for strong normalization due to Curien, Crégut, Lescanne, and Kluge.  ...  For example, one puts the expressive power of the lambda calculus to the test in the area of lambda definability.  ...  Relating the abstract machine and the reduction semantics for TLLF Starting with the reduction semantics for the programming language TLLF we via the syntactic correspondence derived an abstract machine  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v15i3.21938">doi:10.7146/brics.v15i3.21938</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jaibmuzs55ftponzsit7y5wpx4">fatcat:jaibmuzs55ftponzsit7y5wpx4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190426235127/https://tidsskrift.dk/brics/article/download/21938/19363" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/95/7a/957a9a2aed8ea89f5f661b2a2da63bac7ab701f8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.7146/brics.v15i3.21938"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 239,600 results