Preliminary arrangements of arguments in lazy evaluation

Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way wi...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Husheng, Liao [verfasserIn] Takeichi, Masato

Format:	Artikel
Sprache:	Englisch

Erschienen:	1991

Schlagwörter:	Functional Language Lazy Evaluation SECD Machine

Anmerkung:	© Ohmsha, Ltd. and Springer 1991

Übergeordnetes Werk:	Enthalten in: New generation computing - Springer-Verlag, 1983, 9(1991), 2 vom: Juni, Seite 135-147
Übergeordnetes Werk:	volume:9 ; year:1991 ; number:2 ; month:06 ; pages:135-147

Links:	Volltext

DOI / URN:	10.1007/BF03037640

Katalog-ID:	OLC2042710822

Internformat


LEADER	01000caa a22002652 4500
001	OLC2042710822
003	DE-627
005	20230331140800.0
007	tu
008	200819s1991 xx \|\|\|\|\| 00\| \|\|eng c
024	7		\|a 10.1007/BF03037640 \|2 doi
035			\|a (DE-627)OLC2042710822
035			\|a (DE-He213)BF03037640-p
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
082	0	4	\|a 620 \|q VZ
084			\|a 11 \|2 ssgn
084			\|a 54.00 \|2 bkl
100	1		\|a Husheng, Liao \|e verfasserin \|4 aut
245	1	0	\|a Preliminary arrangements of arguments in lazy evaluation
264		1	\|c 1991
336			\|a Text \|b txt \|2 rdacontent
337			\|a ohne Hilfsmittel zu benutzen \|b n \|2 rdamedia
338			\|a Band \|b nc \|2 rdacarrier
500			\|a © Ohmsha, Ltd. and Springer 1991
520			\|a Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results.
650		4	\|a Functional Language
650		4	\|a Lazy Evaluation
650		4	\|a SECD Machine
700	1		\|a Takeichi, Masato \|4 aut
773	0	8	\|i Enthalten in \|t New generation computing \|d Springer-Verlag, 1983 \|g 9(1991), 2 vom: Juni, Seite 135-147 \|w (DE-627)130628972 \|w (DE-600)797870-4 \|w (DE-576)016134826 \|x 0288-3635 \|7 nnns
773	1	8	\|g volume:9 \|g year:1991 \|g number:2 \|g month:06 \|g pages:135-147
856	4	1	\|u https://doi.org/10.1007/BF03037640 \|z lizenzpflichtig \|3 Volltext
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_OLC
912			\|a SSG-OLC-TEC
912			\|a SSG-OLC-MAT
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_32
912			\|a GBV_ILN_40
912			\|a GBV_ILN_62
912			\|a GBV_ILN_70
912			\|a GBV_ILN_100
912			\|a GBV_ILN_120
912			\|a GBV_ILN_130
912			\|a GBV_ILN_267
912			\|a GBV_ILN_285
912			\|a GBV_ILN_2004
912			\|a GBV_ILN_2005
912			\|a GBV_ILN_2008
912			\|a GBV_ILN_2010
912			\|a GBV_ILN_2015
912			\|a GBV_ILN_2018
912			\|a GBV_ILN_2020
912			\|a GBV_ILN_2021
912			\|a GBV_ILN_2190
912			\|a GBV_ILN_2244
912			\|a GBV_ILN_4036
912			\|a GBV_ILN_4046
912			\|a GBV_ILN_4103
912			\|a GBV_ILN_4116
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4266
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4314
912			\|a GBV_ILN_4315
912			\|a GBV_ILN_4316
912			\|a GBV_ILN_4318
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4334
912			\|a GBV_ILN_4700
936	b	k	\|a 54.00 \|q VZ
951			\|a AR
952			\|d 9 \|j 1991 \|e 2 \|c 06 \|h 135-147

Indexfelder

author_variant	l h lh m t mt
matchkey_str	article:02883635:1991----::rlmnrarneetoagmnsn
hierarchy_sort_str	1991
bklnumber	54.00
publishDate	1991
allfields	10.1007/BF03037640 doi (DE-627)OLC2042710822 (DE-He213)BF03037640-p DE-627 ger DE-627 rakwb eng 620 VZ 11 ssgn 54.00 bkl Husheng, Liao verfasserin aut Preliminary arrangements of arguments in lazy evaluation 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Ohmsha, Ltd. and Springer 1991 Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. Functional Language Lazy Evaluation SECD Machine Takeichi, Masato aut Enthalten in New generation computing Springer-Verlag, 1983 9(1991), 2 vom: Juni, Seite 135-147 (DE-627)130628972 (DE-600)797870-4 (DE-576)016134826 0288-3635 nnns volume:9 year:1991 number:2 month:06 pages:135-147 https://doi.org/10.1007/BF03037640 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_32 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_130 GBV_ILN_267 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4116 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4334 GBV_ILN_4700 54.00 VZ AR 9 1991 2 06 135-147
spelling	10.1007/BF03037640 doi (DE-627)OLC2042710822 (DE-He213)BF03037640-p DE-627 ger DE-627 rakwb eng 620 VZ 11 ssgn 54.00 bkl Husheng, Liao verfasserin aut Preliminary arrangements of arguments in lazy evaluation 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Ohmsha, Ltd. and Springer 1991 Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. Functional Language Lazy Evaluation SECD Machine Takeichi, Masato aut Enthalten in New generation computing Springer-Verlag, 1983 9(1991), 2 vom: Juni, Seite 135-147 (DE-627)130628972 (DE-600)797870-4 (DE-576)016134826 0288-3635 nnns volume:9 year:1991 number:2 month:06 pages:135-147 https://doi.org/10.1007/BF03037640 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_32 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_130 GBV_ILN_267 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4116 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4334 GBV_ILN_4700 54.00 VZ AR 9 1991 2 06 135-147
allfields_unstemmed	10.1007/BF03037640 doi (DE-627)OLC2042710822 (DE-He213)BF03037640-p DE-627 ger DE-627 rakwb eng 620 VZ 11 ssgn 54.00 bkl Husheng, Liao verfasserin aut Preliminary arrangements of arguments in lazy evaluation 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Ohmsha, Ltd. and Springer 1991 Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. Functional Language Lazy Evaluation SECD Machine Takeichi, Masato aut Enthalten in New generation computing Springer-Verlag, 1983 9(1991), 2 vom: Juni, Seite 135-147 (DE-627)130628972 (DE-600)797870-4 (DE-576)016134826 0288-3635 nnns volume:9 year:1991 number:2 month:06 pages:135-147 https://doi.org/10.1007/BF03037640 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_32 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_130 GBV_ILN_267 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4116 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4334 GBV_ILN_4700 54.00 VZ AR 9 1991 2 06 135-147
allfieldsGer	10.1007/BF03037640 doi (DE-627)OLC2042710822 (DE-He213)BF03037640-p DE-627 ger DE-627 rakwb eng 620 VZ 11 ssgn 54.00 bkl Husheng, Liao verfasserin aut Preliminary arrangements of arguments in lazy evaluation 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Ohmsha, Ltd. and Springer 1991 Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. Functional Language Lazy Evaluation SECD Machine Takeichi, Masato aut Enthalten in New generation computing Springer-Verlag, 1983 9(1991), 2 vom: Juni, Seite 135-147 (DE-627)130628972 (DE-600)797870-4 (DE-576)016134826 0288-3635 nnns volume:9 year:1991 number:2 month:06 pages:135-147 https://doi.org/10.1007/BF03037640 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_32 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_130 GBV_ILN_267 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4116 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4334 GBV_ILN_4700 54.00 VZ AR 9 1991 2 06 135-147
allfieldsSound	10.1007/BF03037640 doi (DE-627)OLC2042710822 (DE-He213)BF03037640-p DE-627 ger DE-627 rakwb eng 620 VZ 11 ssgn 54.00 bkl Husheng, Liao verfasserin aut Preliminary arrangements of arguments in lazy evaluation 1991 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier © Ohmsha, Ltd. and Springer 1991 Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. Functional Language Lazy Evaluation SECD Machine Takeichi, Masato aut Enthalten in New generation computing Springer-Verlag, 1983 9(1991), 2 vom: Juni, Seite 135-147 (DE-627)130628972 (DE-600)797870-4 (DE-576)016134826 0288-3635 nnns volume:9 year:1991 number:2 month:06 pages:135-147 https://doi.org/10.1007/BF03037640 lizenzpflichtig Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_32 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_130 GBV_ILN_267 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4116 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4334 GBV_ILN_4700 54.00 VZ AR 9 1991 2 06 135-147
language	English
source	Enthalten in New generation computing 9(1991), 2 vom: Juni, Seite 135-147 volume:9 year:1991 number:2 month:06 pages:135-147
sourceStr	Enthalten in New generation computing 9(1991), 2 vom: Juni, Seite 135-147 volume:9 year:1991 number:2 month:06 pages:135-147
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Functional Language Lazy Evaluation SECD Machine
dewey-raw	620
isfreeaccess_bool	false
container_title	New generation computing
authorswithroles_txt_mv	Husheng, Liao @@aut@@ Takeichi, Masato @@aut@@
publishDateDaySort_date	1991-06-01T00:00:00Z
hierarchy_top_id	130628972
dewey-sort	3620
id	OLC2042710822
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2042710822</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331140800.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1991 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF03037640</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2042710822</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF03037640-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Husheng, Liao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Preliminary arrangements of arguments in lazy evaluation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1991</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Ohmsha, Ltd. and Springer 1991</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional Language</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lazy Evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SECD Machine</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Takeichi, Masato</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">New generation computing</subfield><subfield code="d">Springer-Verlag, 1983</subfield><subfield code="g">9(1991), 2 vom: Juni, Seite 135-147</subfield><subfield code="w">(DE-627)130628972</subfield><subfield code="w">(DE-600)797870-4</subfield><subfield code="w">(DE-576)016134826</subfield><subfield code="x">0288-3635</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:1991</subfield><subfield code="g">number:2</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:135-147</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF03037640</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4315</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">1991</subfield><subfield code="e">2</subfield><subfield code="c">06</subfield><subfield code="h">135-147</subfield></datafield></record></collection>
author	Husheng, Liao
spellingShingle	Husheng, Liao ddc 620 ssgn 11 bkl 54.00 misc Functional Language misc Lazy Evaluation misc SECD Machine Preliminary arrangements of arguments in lazy evaluation
authorStr	Husheng, Liao
ppnlink_with_tag_str_mv	@@773@@(DE-627)130628972
format	Article
dewey-ones	620 - Engineering & allied operations
delete_txt_mv	keep
author_role	aut aut
collection	OLC
remote_str	false
illustrated	Not Illustrated
issn	0288-3635
topic_title	620 VZ 11 ssgn 54.00 bkl Preliminary arrangements of arguments in lazy evaluation Functional Language Lazy Evaluation SECD Machine
topic	ddc 620 ssgn 11 bkl 54.00 misc Functional Language misc Lazy Evaluation misc SECD Machine
topic_unstemmed	ddc 620 ssgn 11 bkl 54.00 misc Functional Language misc Lazy Evaluation misc SECD Machine
topic_browse	ddc 620 ssgn 11 bkl 54.00 misc Functional Language misc Lazy Evaluation misc SECD Machine
format_facet	Aufsätze Gedruckte Aufsätze
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	nc
hierarchy_parent_title	New generation computing
hierarchy_parent_id	130628972
dewey-tens	620 - Engineering
hierarchy_top_title	New generation computing
isfreeaccess_txt	false
familylinks_str_mv	(DE-627)130628972 (DE-600)797870-4 (DE-576)016134826
title	Preliminary arrangements of arguments in lazy evaluation
ctrlnum	(DE-627)OLC2042710822 (DE-He213)BF03037640-p
title_full	Preliminary arrangements of arguments in lazy evaluation
author_sort	Husheng, Liao
journal	New generation computing
journalStr	New generation computing
lang_code	eng
isOA_bool	false
dewey-hundreds	600 - Technology
recordtype	marc
publishDateSort	1991
contenttype_str_mv	txt
container_start_page	135
author_browse	Husheng, Liao Takeichi, Masato
container_volume	9
class	620 VZ 11 ssgn 54.00 bkl
format_se	Aufsätze
author-letter	Husheng, Liao
doi_str_mv	10.1007/BF03037640
dewey-full	620
title_sort	preliminary arrangements of arguments in lazy evaluation
title_auth	Preliminary arrangements of arguments in lazy evaluation
abstract	Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. © Ohmsha, Ltd. and Springer 1991
abstractGer	Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. © Ohmsha, Ltd. and Springer 1991
abstract_unstemmed	Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results. © Ohmsha, Ltd. and Springer 1991
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-TEC SSG-OLC-MAT GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_32 GBV_ILN_40 GBV_ILN_62 GBV_ILN_70 GBV_ILN_100 GBV_ILN_120 GBV_ILN_130 GBV_ILN_267 GBV_ILN_285 GBV_ILN_2004 GBV_ILN_2005 GBV_ILN_2008 GBV_ILN_2010 GBV_ILN_2015 GBV_ILN_2018 GBV_ILN_2020 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_2244 GBV_ILN_4036 GBV_ILN_4046 GBV_ILN_4103 GBV_ILN_4116 GBV_ILN_4126 GBV_ILN_4266 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4314 GBV_ILN_4315 GBV_ILN_4316 GBV_ILN_4318 GBV_ILN_4324 GBV_ILN_4334 GBV_ILN_4700
container_issue	2
title_short	Preliminary arrangements of arguments in lazy evaluation
url	https://doi.org/10.1007/BF03037640
remote_bool	false
author2	Takeichi, Masato
author2Str	Takeichi, Masato
ppnlink	130628972
mediatype_str_mv	n
isOA_txt	false
hochschulschrift_bool	false
doi_str	10.1007/BF03037640
up_date	2024-07-03T16:23:48.870Z
_version_	1803575706385383424
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">OLC2042710822</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230331140800.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">200819s1991 xx \|\|\|\|\| 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1007/BF03037640</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC2042710822</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-He213)BF03037640-p</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">620</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">11</subfield><subfield code="2">ssgn</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Husheng, Liao</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Preliminary arrangements of arguments in lazy evaluation</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">1991</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">© Ohmsha, Ltd. and Springer 1991</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">Abstract This paper describes a new implementation technique calledpreliminary arrangements of arguments for lazy functional languages. Unlike conventional lazy evaluators, the evaluator with preliminary arrangements partly processes every argument before calling functions. It works in a lazy way with less memory cells than conventional methods. The practical importance of this technique is demonstrated by some benchmark results.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Functional Language</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Lazy Evaluation</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">SECD Machine</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Takeichi, Masato</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">New generation computing</subfield><subfield code="d">Springer-Verlag, 1983</subfield><subfield code="g">9(1991), 2 vom: Juni, Seite 135-147</subfield><subfield code="w">(DE-627)130628972</subfield><subfield code="w">(DE-600)797870-4</subfield><subfield code="w">(DE-576)016134826</subfield><subfield code="x">0288-3635</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:9</subfield><subfield code="g">year:1991</subfield><subfield code="g">number:2</subfield><subfield code="g">month:06</subfield><subfield code="g">pages:135-147</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">https://doi.org/10.1007/BF03037640</subfield><subfield code="z">lizenzpflichtig</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-TEC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_32</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_100</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_120</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_130</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_267</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2004</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2005</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2008</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2010</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2015</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2018</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2020</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2244</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4036</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4046</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4103</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4116</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4266</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4314</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4315</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4316</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4318</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4334</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">VZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">9</subfield><subfield code="j">1991</subfield><subfield code="e">2</subfield><subfield code="c">06</subfield><subfield code="h">135-147</subfield></datafield></record></collection>
score	7.4006615

Nicht das Richtige dabei?

Schreiben Sie uns!

Preliminary arrangements of arguments in lazy evaluation

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?