Search results for "Call-by-value"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
15	Ravi Sethi, Adrian Tang 0001	Constructing Call-by-Value Continuation Semantics.	ICALP	1979	DBLP DOI BibTeX RDF
15	Torben Æ. Mogensen	Linear Time Self-Interpretation of the Pure Lambda Calculus.	Ershov Memorial Conference	1999	DBLP DOI BibTeX RDF
15	Olivier Danvy, Julia L. Lawall	Back to Direct Style II: First-Class Continuations.	LISP and Functional Programming	1992	DBLP DOI BibTeX RDF	SCHEME
14	Davide Sangiorgi, Naoki Kobayashi 0001, Eijiro Sumii	Environmental Bisimulations for Higher-Order Languages.	LICS	2007	DBLP DOI BibTeX RDF
14	Tom Hirschowitz	Rigid Mixin Modules.	FLOPS	2004	DBLP DOI BibTeX RDF
14	Richard Kelsey, William D. Clinger, Jonathan Rees	Revised5 Report on the Algorithmic Language Scheme.	ACM SIGPLAN Notices	1998	DBLP DOI BibTeX RDF	SCHEME
14	Anindya Banerjee 0001, David A. Schmidt	A Categorical Interpretation of Landin's Correspondence Principle.	MFPS	1993	DBLP DOI BibTeX RDF
14	Gérard Berry, Jean-Jacques Lévy	Minimal and Optimal Computations of Recursive Programs.	POPL	1977	DBLP DOI BibTeX RDF
13	Gavin M. Bierman, Michael W. Hicks, Peter Sewell, Gareth Paul Stoyle, Keith Wansbrough	Dynamic rebinding for marshalling and update, with destruct-time?	ICFP	2003	DBLP DOI BibTeX RDF	programming languages, distributed programming, lambda calculus, dynamic binding, dynamic update, serialisation, marshalling
12	Frank Pfenning, Robert J. Simmons	Substructural Operational Semantics as Ordered Logic Programming.	LICS	2009	DBLP DOI BibTeX RDF
12	Ronald Garcia, Andrew Lumsdaine, Amr Sabry	Lazy evaluation and delimited control.	POPL	2009	DBLP DOI BibTeX RDF	call-by-need, lambda calculus, abstract machines, delimited continuations, reduction semantics
12	Raffaella Bernardi, Michael Moortgat	Continuation Semantics for Symmetric Categorial Grammar.	WoLLIC	2007	DBLP DOI BibTeX RDF
12	Alex K. Simpson	Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics.	RTA	2005	DBLP DOI BibTeX RDF
12	Jeffrey R. Lewis, John Launchbury, Erik Meijer 0001, Mark Shields	Implicit Parameters: Dynamic Scoping with Static Types.	POPL	2000	DBLP DOI BibTeX RDF
12	Julia L. Lawall, Harry G. Mairson	Sharing Continuations: Proofnets for Languages with Explicit Control.	ESOP	2000	DBLP DOI BibTeX RDF
12	Rémi Douence, Pascal Fradet	A Systematic Study of Functional Language Implementations.	ACM Trans. Program. Lang. Syst.	1998	DBLP DOI BibTeX RDF	compilers, program transformation, functional programming, combinators, abstract machines
12	Sheng Liang, Paul Hudak, Mark P. Jones	Monad Transformers and Modular Interpreters.	POPL	1995	DBLP DOI BibTeX RDF
12	Paul Hudak, Jonathan Young	A Collecting Interpretation of Expressions (Without Powerdomains). (long version: TOPLAS 13(2): 269-290 (1991))	POPL	1988	DBLP DOI BibTeX RDF
12	S. Kamal Abdali, David S. Wise	Standard, Storeless Semantics for ALGOL-Style Block Structure and Call-by Name.	Mathematical Foundations of Programming Semantics	1985	DBLP DOI BibTeX RDF
12	Neil D. Jones, Steven S. Muchnick	Even Simple Programs are Hard to Analyze.	POPL	1975	DBLP DOI BibTeX RDF
11	Pietro Di Gianantonio, Furio Honsell, Marina Lenisa	RPO, Second-Order Contexts, and lambda-Calculus.	FoSSaCS	2008	DBLP DOI BibTeX RDF
11	Kazuhiro Inaba, Haruo Hosoya, Sebastian Maneth	Multi-Return Macro Tree Transducers.	CIAA	2008	DBLP DOI BibTeX RDF
11	Zaynah Dargaye, Xavier Leroy	Mechanized Verification of CPS Transformations.	LPAR	2007	DBLP DOI BibTeX RDF
11	Ugo Dal Lago, Simone Martini 0001	An Invariant Cost Model for the Lambda Calculus.	CiE	2006	DBLP DOI BibTeX RDF
11	Simon Helsen, Peter Thiemann 0001	Polymorphic specialization for ML.	ACM Trans. Program. Lang. Syst.	2004	DBLP DOI BibTeX RDF	regions, program specialization, Binding-time analysis
11	Neil D. Jones, Nina Bohr	Termination Analysis of the Untyped lamba-Calculus.	RTA	2004	DBLP DOI BibTeX RDF
11	Gordon D. Plotkin, John Power	Adequacy for Algebraic Effects.	FoSSaCS	2001	DBLP DOI BibTeX RDF
11	Jon G. Riecke, Ramesh Viswanathan	Isolating Side Effects in Sequential Languages.	POPL	1995	DBLP DOI BibTeX RDF	Standard ML
11	Roberto M. Amadio	On the Adequacy of Per Models.	MFCS	1993	DBLP DOI BibTeX RDF	Second order lambda-calculus, Per models, Denotational vs. Operational Semantics
11	Alan Mycroft, Flemming Nielson	Strong Abstract Interpretation Using Power Domains (Extended Abstract).	ICALP	1983	DBLP DOI BibTeX RDF
11	Willem P. de Roever	Recursion and Parameter Mechanisms: An Axiomatic Approach.	ICALP	1974	DBLP DOI BibTeX RDF
9	Eijiro Sumii, Hideo Bannai	VM lambda: A Functional Calculusfor Scientific Discovery.	FLOPS	2002	DBLP DOI BibTeX RDF
8	Zena M. Ariola, Aaron Bohannon, Amr Sabry	Sequent calculi and abstract machines.	ACM Trans. Program. Lang. Syst.	2009	DBLP DOI BibTeX RDF	Krivine machine, duality, explicit substitutions, natural deduction, Curry-Howard isomorphism
8	Jacques Carette, Oleg Kiselyov, Chung-chieh Shan	Finally Tagless, Partially Evaluated.	APLAS	2007	DBLP DOI BibTeX RDF
8	Davide Sangiorgi, Naoki Kobayashi 0001, Eijiro Sumii	Logical Bisimulations and Functional Languages.	FSEN	2007	DBLP DOI BibTeX RDF
8	Ian Mackie	Encoding Strategies in the Lambda Calculus with Interaction Nets.	IFL	2005	DBLP DOI BibTeX RDF
8	Andrzej Filinski, Henning Korsholm Rohde	A Denotational Account of Untyped Normalization by Evaluation.	FoSSaCS	2004	DBLP DOI BibTeX RDF
8	Emmanuel Polonowski	Strong Normalization of lambda-mu-mu/tilde-Calculus with Explicit Substitutions.	FoSSaCS	2004	DBLP DOI BibTeX RDF
8	Luigi Liquori, Bernard P. Serpette	iRho: an imperative rewriting calculus.	PPDP	2004	DBLP DOI BibTeX RDF	certied software, rewriting-calculus, pattern-matching, types, term rewriting systems, natural semantics
8	Jerome Vouillon	Subtyping Union Types.	CSL	2004	DBLP DOI BibTeX RDF	semantics, lambda-calculus, subtyping, union types
8	Mads Sig Ager	From Natural Semantics to Abstract Machines.	LOPSTR	2004	DBLP DOI BibTeX RDF
8	Olivier Laurent 0001	Polarized Games.	LICS	2002	DBLP DOI BibTeX RDF
8	Peter Sestoft	Demonstrating Lambda Calculus Reduction.	The Essence of Computation	2002	DBLP DOI BibTeX RDF
8	Hayco de Jong, Paul Klint	ToolBus: The Next Generation.	FMCO	2002	DBLP DOI BibTeX RDF
8	Martin Berger 0001, Kohei Honda 0001, Nobuko Yoshida	Sequentiality and the pi-Calculus.	TLCA	2001	DBLP DOI BibTeX RDF
8	Karim Nour	Mixed logic and storage operators.	Arch. Math. Log.	2000	DBLP DOI BibTeX RDF
8	Pierre-Louis Curien	Abstract Machines, Control, and Sequents.	APPSEM	2000	DBLP DOI BibTeX RDF
8	Peter Dybjer, Andrzej Filinski	Normalization and Partial Evaluation.	APPSEM	2000	DBLP DOI BibTeX RDF
8	Maribel Fernández, Ian Mackie	Closed Reductions in the lambda-Calculus.	CSL	1999	DBLP DOI BibTeX RDF
8	Ichiro Ogata	Cut Elimination for Classical Proofs as Continuation Passing Style Computation.	ASIAN	1998	DBLP DOI BibTeX RDF
8	Jens Palsberg	Closure Analysis in Constraint Form.	ACM Trans. Program. Lang. Syst.	1995	DBLP DOI BibTeX RDF	constraints, flow analysis, correctness proof
8	Jens Palsberg	Flobal Program Analysis in Constraint Form.	CAAP	1994	DBLP DOI BibTeX RDF
8	Bruno Monsuez	Polymorphic Typing for Call-by-Name Semantics.	Formal Methods in Programming and Their Applications	1993	DBLP DOI BibTeX RDF
8	Julia L. Lawall, Olivier Danvy	Separating Stages in the Continuation-Passing Style Transformation.	POPL	1993	DBLP DOI BibTeX RDF	SCHEME
8	R. C. Sekar 0001, Shaunak Pawagi, I. V. Ramakrishnan	Small Domains Spell Fast Strictness Analysis.	POPL	1990	DBLP DOI BibTeX RDF
8	Satish R. Thatte	Quasi-Static Typing.	POPL	1990	DBLP DOI BibTeX RDF
8	John Hannan, Dale Miller 0001	From Operational Semantics to Abstract Machines: Preliminary Results.	LISP and Functional Programming	1990	DBLP DOI BibTeX RDF
8	Bent Thomsen	A Calculus of Higher Order Communicating Systems.	POPL	1989	DBLP DOI BibTeX RDF	CCS
8	Arch Douglas Robison	The Illinois functional programming interpreter.	PLDI	1987	DBLP DOI BibTeX RDF	FP
8	Albert R. Meyer, John C. Mitchell	Axiomatic Definability and Completeness for Recursive Programs.	POPL	1982	DBLP DOI BibTeX RDF
8	Barry K. Rosen	Tree-Manipulating Systems and Church-Rosser Theorems.	J. ACM	1973	DBLP DOI BibTeX RDF
7	Markus Müller-Olm, Helmut Seidl, Bernhard Steffen	Interprocedural Herbrand Equalities.	ESOP	2005	DBLP DOI BibTeX RDF
7	Hongwei Xi	Evaluation Under Lambda Abstraction.	PLILP	1997	DBLP DOI BibTeX RDF	partial evaluation, lambda-calculus, run-time code generation
7	Chrysafis Hartonas, Matthew Hennessy	Full Abstractness for a Functional/Concurrent Language with Higher-Order Value-Passing (Extended Abstract).	CSL	1997	DBLP DOI BibTeX RDF
5	Norman Danner, James S. Royer	Two Algorithms in Search of a Type-System.	Theory Comput. Syst.	2009	DBLP DOI BibTeX RDF	Higher-type computation, Higher-type complexity, Basic feasible functionals, Compositional semantics, Implicit computational complexity
5	Colin Riba	On the Values of Reducibility Candidates.	TLCA	2009	DBLP DOI BibTeX RDF
5	Derek Dreyer, Amal Ahmed 0001, Lars Birkedal	Logical Step-Indexed Logical Relations.	LICS	2009	DBLP DOI BibTeX RDF
5	Kristian Støvring, Søren B. Lassen	A Complete, Co-inductive Syntactic Theory of Sequential Control and State.	Semantics and Algebraic Specification	2009	DBLP DOI BibTeX RDF
5	Annette Bieniusa, Peter Thiemann 0001	How to CPS Transform a Monad.	CC	2009	DBLP DOI BibTeX RDF
5	Andrzej S. Murawski, Nikos Tzevelekos	Full Abstraction for Reduced ML.	FoSSaCS	2009	DBLP DOI BibTeX RDF
5	Lars Birkedal, Kristian Støvring, Jacob Thamsborg	Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types.	FoSSaCS	2009	DBLP DOI BibTeX RDF
5	Roberto M. Amadio	On Stratified Regions.	APLAS	2009	DBLP DOI BibTeX RDF	Types and effects, Reducibility candidates, Termination
5	Eijiro Sumii	A Theory of Non-monotone Memory (Or: Contexts for free).	ESOP	2009	DBLP DOI BibTeX RDF
5	Lars Birkedal, Kristian Støvring, Jacob Thamsborg	Relational parametricity for references and recursive types.	TLDI	2009	DBLP DOI BibTeX RDF	general references, impredicative polymorphism, denotational semantics, recursive types, relational parametricity, possible world semantics
5	Gordon D. Plotkin	Adequacy for Infinitary Algebraic Effects (Abstract).	CALCO	2009	DBLP DOI BibTeX RDF
5	Guillaume Munch-Maccagnoni	Focalisation and Classical Realisability.	CSL	2009	DBLP DOI BibTeX RDF
5	Yukiyoshi Kameyama, Oleg Kiselyov, Chung-chieh Shan	Closing the stage: from staged code to typed closures.	PEPM	2008	DBLP DOI BibTeX RDF	multistage programming, mutable state and control effects, type abstraction, closures, parametric polymorphism
5	Chung-chieh Shan	A static simulation of dynamic delimited control.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Delimited control operators, Macro expressibility, Shift and reset, Control and prompt, Continuation-passing style (CPS)
5	Yukiyoshi Kameyama	Axioms for control operators in the CPS hierarchy.	High. Order Symb. Comput.	2007	DBLP DOI BibTeX RDF	Type system, Axiomatization, Delimited continuation, CPS translation, Control operator
5	Kohei Honda 0001, Nobuko Yoshida	A uniform type structure for secure information flow.	ACM Trans. Program. Lang. Syst.	2007	DBLP DOI BibTeX RDF	The ?-calculus, type-based program analysis, typing system, secure information flow
5	Kristian Støvring, Søren B. Lassen	A complete, co-inductive syntactic theory of sequential control and state.	POPL	2007	DBLP DOI BibTeX RDF	mutable references, continuations, bisimulation
5	Nobuko Yoshida, Kohei Honda 0001, Martin Berger 0001	Logical Reasoning for Higher-Order Functions with Local State.	FoSSaCS	2007	DBLP DOI BibTeX RDF
5	Adam Megacz	A coinductive monad for prop-bounded recursion.	PLPV	2007	DBLP DOI BibTeX RDF	coinductive types, type theory
5	Sebastian Maneth, Thomas Perst, Helmut Seidl	Exact XML Type Checking in Polynomial Time.	ICDT	2007	DBLP DOI BibTeX RDF
5	Guillem Godoy, Eduard Huntingford	Innermost-Reachability and Innermost-Joinability Are Decidable for Shallow Term Rewrite Systems.	RTA	2007	DBLP DOI BibTeX RDF
5	Norman Danner, James S. Royer	Time-Complexity Semantics for Feasible Affine Recursions.	CiE	2007	DBLP DOI BibTeX RDF
5	Umut A. Acar, Guy E. Blelloch, Robert Harper 0001	Adaptive functional programming.	ACM Trans. Program. Lang. Syst.	2006	DBLP DOI BibTeX RDF	Incremental computation, dynamic algorithms, adaptive computation
5	Futoshi Iwama, Atsushi Igarashi, Naoki Kobayashi 0001	Resource usage analysis for a functional language with exceptions.	PEPM	2006	DBLP DOI BibTeX RDF	resource usage analysis, type system, type inference, exception, effect system
5	Norman Danner, James S. Royer	Adventures in time and space.	POPL	2006	DBLP DOI BibTeX RDF
5	Kohei Honda 0001, Martin Berger 0001, Nobuko Yoshida	Descriptive and Relative Completeness of Logics for Higher-Order Functions.	ICALP (2)	2006	DBLP DOI BibTeX RDF
5	Luca Paolini, Elaine Pimentel, Simona Ronchi Della Rocca	An Operational Characterization of Strong Normalization.	FoSSaCS	2006	DBLP DOI BibTeX RDF
5	Keiko Nakata 0001, Jacques Garrigue	Recursive modules for programming.	ICFP	2006	DBLP DOI BibTeX RDF	applicative functors, the expression problem, type systems, type inference, recursive modules
5	James Laird	Game Semantics for Higher-Order Concurrency.	FSTTCS	2006	DBLP DOI BibTeX RDF
5	Peter Selinger, Benoît Valiron	A Lambda Calculus for Quantum Computation with Classical Control.	TLCA	2005	DBLP DOI BibTeX RDF
5	Kohei Honda 0001, Nobuko Yoshida, Martin Berger 0001	An Observationally Complete Program Logic for Imperative Higher-Order Frame Rules.	LICS	2005	DBLP DOI BibTeX RDF
5	Didier Rémy	Simple, partial type-inference for System F based on type-containment.	ICFP	2005	DBLP DOI BibTeX RDF	type containment, type reconstruction, polymorphism, type inference, System F, elaboration
5	Martin Berger 0001, Kohei Honda 0001, Nobuko Yoshida	A logical analysis of aliasing in imperative higher-order functions.	ICFP	2005	DBLP DOI BibTeX RDF	functional programming, typing, aliasing, hoare-logics, ?-calculus, pointers, modalities
5	Kevin Donnelly, Hongwei Xi	Combining higher-order abstract syntax with first-order abstract syntax in ATS.	MERLIN	2005	DBLP DOI BibTeX RDF	ATS/LF, theorem proving, dependent types, higher-order abstract syntax, ATS
5	Jan Schwinghammer	A Typed Semantics of Higher-Order Store and Subtyping.	ICTCS	2005	DBLP DOI BibTeX RDF
5	Louis Mandel, Marc Pouzet	ReactiveML: a reactive extension to ML.	PPDP	2005	DBLP DOI BibTeX RDF	semantics, functional programming, reactive programming