Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("APPEL PAR VALEUR")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 48

  • Page / 2
Export

Selection :

  • and

THE THEORY AND PRACTICE OF TRANSFORMING CALL-BY-NEED INTO CALL-BY-VALUEMYCROFT A.1980; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1980; VOL. 83; PP. 269-281; BIBL. 10 REF.Conference Paper

CONSTRUCTING CALL-BY-VALUE CONTINUATION SEMANTICSSETHI R; TANG A.1979; LECTURE NOTES COMPUTER SCI.; DEU; DA. 1979; NO 71; PP. 556-570; BIBL. 12 REF.Conference Paper

CONSTRUCTING CALL-BY-VALUE CONTINUATION SEMANTICSSETHI R; TANG A.1980; J. ASS. COMPUTG MACHIN; USA; DA. 1980; VOL. 27; NO 3; PP. 580-597; BIBL. 16 REF.Article

THE SEMANTICS OF CALL-BY-VALUE AND CALL-BY-NAME IN A NONDETERMINISTIC ENVIRONMENTHENNESSY MCB.1980; S.I.A.M. J. COMPUTG; USA; DA. 1980; VOL. 9; NO 1; PP. 67-84; BIBL. 21 REF.Article

PARAMETER PASSING IN NONDETERMINISTIC RECURSIVE PROGRAMSBENSON DB.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 1; PP. 50-62; BIBL. 14 REF.Article

A PROPOS DE LA SEMANTIQUE DE L'APPEL PAR VALEUR SELON A. ARNOLDGUESSARIAN I.1978; R.A.I.R.O., INFORMAT. THEOR.; FRA; DA. 1978; VOL. 12; NO 4; PP. 287-289; BIBL. 2 REF.Serial Issue

Call-by-value is dual to call-by-name : ReloadedWADLER, Philip.Lecture notes in computer science. 2005, pp 185-203, issn 0302-9743, isbn 3-540-25596-6, 19 p.Conference Paper

Subtyping union typesVOUILLON, Jérome.Lecture notes in computer science. 2004, pp 415-429, issn 0302-9743, isbn 3-540-23024-6, 15 p.Conference Paper

An operational characterization of strong normalizationPAOLINI, Luca; PIMENTEL, Elaine; ROCCA, Simona Ronchi et al.Lecture notes in computer science. 2006, pp 367-381, issn 0302-9743, isbn 3-540-33045-3, 1Vol, 15 p.Conference Paper

λμ-calculus and duality : Call-by-name and call-by-valueROCHETEAU, Jérome.Lecture notes in computer science. 2005, pp 204-218, issn 0302-9743, isbn 3-540-25596-6, 15 p.Conference Paper

Interprocedural herbrand equalitiesMÜLLER-OLM, Markus; SEIDL, Helmut; STEFFEN, Bernhard et al.Lecture notes in computer science. 2005, pp 31-45, issn 0302-9743, isbn 3-540-25435-8, 15 p.Conference Paper

Call-by-name and call-by-value as token-passing interaction netsSINOT, Francois-Régis.Lecture notes in computer science. 2005, pp 386-400, issn 0302-9743, isbn 3-540-25593-1, 15 p.Conference Paper

Elementary affine logic and the call-by-value lambda calculusCOPPOLA, Paolo; DAL LAGO, Ugo; DELLA ROCCA, Simona Ronchi et al.Lecture notes in computer science. 2005, pp 131-145, issn 0302-9743, isbn 3-540-25593-1, 15 p.Conference Paper

Axioms for delimited continuations in the CPS hierarchyKAMEYAMA, Yukiyoshi.Lecture notes in computer science. 2004, pp 442-457, issn 0302-9743, isbn 3-540-23024-6, 16 p.Conference Paper

A bisimulation for dynamic sealingSUMII, Eijiro; PIERCE, Benjamin C.ACM SIGPLAN notices. 2004, Vol 39, Num 1, pp 161-172, issn 1523-2867, 12 p.Conference Paper

A proof theoretical account of continuation passing styleOGATA, Ichiro.Lecture notes in computer science. 2002, pp 490-505, issn 0302-9743, isbn 3-540-44240-5, 16 p.Conference Paper

Domain-free λμ-calculusFUJITA, Ken-Etsu.Theoretical informatics and applications. 2000, Vol 34, Num 6, pp 433-466Article

Call-by-value mixin modules reduction semantics, side effects, typesHIRSCHOWITZ, Tom; LEROY, Xavier; WELLS, J. B et al.Lecture notes in computer science. 2004, pp 64-78, issn 0302-9743, isbn 3-540-21313-9, 15 p.Conference Paper

Descriptive and Relative Completeness of Logics for Higher-Order FunctionsHONDA, Kohei; BERGER, Martin; YOSHIDA, Nobuko et al.Lecture notes in computer science. 2006, pp 360-371, issn 0302-9743, isbn 3-540-35904-4, 12 p.Conference Paper

Positive Supercompilation for a Higher Order Call-By-Value LanguageJONSSON, Peter A; NORDLANDER, Johan.ACM SIGPLAN notices. 2009, Vol 44, Num 1, pp 277-288, issn 1523-2867, 12 p.Conference Paper

Rigid mixin modulesHIRSCHOWITZ, Tom.Lecture notes in computer science. 2004, pp 214-228, issn 0302-9743, isbn 3-540-21402-X, 15 p.Conference Paper

Completeness of intersection and union type assignment systems for call-by-value λ-modelsISHIHARA, Hajime; KURATA, Toshihiko.Theoretical computer science. 2002, Vol 272, Num 1-2, pp 197-221, issn 0304-3975Article

A computation model of Korean lexical processingYIM, Hyungwook; LIM, Heuseok; PARK, Kinam et al.Lecture notes in computer science. 2005, issn 0302-9743, isbn 3-540-28323-4, 3Vol, Part 1, 844-849Conference Paper

A typed semantics of higher-order store and subtypingSCHWINGHAMMER, Jan.Lecture notes in computer science. 2005, pp 390-405, issn 0302-9743, isbn 3-540-29106-7, 1Vol, 16 p.Conference Paper

Strong normalization of λμμ-calculus with explicit substitutionsPOLONOVSKI, Emmanuel.Lecture notes in computer science. 2004, pp 423-437, issn 0302-9743, isbn 3-540-21298-1, 15 p.Conference Paper

  • Page / 2