A Semantical and Operational Account of Call-by-Value Solvability

[1]  A. Tu.  Tu-16 A , 2014 .

[2]  Antonio Bucciarelli,et al.  Full Abstraction for the Resource Lambda Calculus with Tests, through Taylor Expansion , 2012, Log. Methods Comput. Sci..

[3]  Luca Paolini,et al.  Call-by-Value Solvability, Revisited , 2012, FLOPS.

[4]  Delia Kesner,et al.  The Permutative λ-Calculus , 2012, LPAR.

[5]  Thomas Ehrhard,et al.  Collapsing non-idempotent intersection types , 2012, CSL.

[6]  Tom Schrijvers,et al.  Functional and Logic Programming , 2012, Lecture Notes in Computer Science.

[7]  Elaine Pimentel,et al.  Strong normalization from an unusual point of view , 2011, Theor. Comput. Sci..

[8]  Johanna N. Y. Franklin.  Schnorr triviality and genericity , 2010, The Journal of Symbolic Logic.

[9]  Hugo Herbelin,et al.  An Operational Account of Call-by-Value Minimal and Classical lambda-Calculus in "Natural Deduction" Form , 2009, TLCA.

[10]  Paul-André Melliès.  CATEGORICAL SEMANTICS OF LINEAR LOGIC , 2009 .

[11]  Roy Dyckhoff,et al.  Call-by-Value lambda-calculus and LJQ , 2007, J. Log. Comput..

[12]  Sam Lindley,et al.  Extensional Rewriting with Sums , 2007, TLCA.

[13]  Luca Paolini,et al.  The Parametric Lambda-Calculus: a Metamodel for Computation , 2004 .

[14]  Frank Wolter,et al.  Monodic fragments of first-order temporal logics: 2000-2001 A.D , 2001, LPAR.

[15]  Luca Paolini,et al.  Call-by-Value Separability and Computability , 2001, ICTCS.

[16]  Simona Ronchi Della Rocca,et al.  Call-by-value Solvability , 1999, RAIRO Theor. Informatics Appl..

[17]  Martin Hofmann,et al.  Sound and complete axiomatisations of call-by-value control operators , 1995, Mathematical Structures in Computer Science.

[18]  Laurent Regnier,et al.  Une équivalence sur les lambda-termes , 1994, Theor. Comput. Sci..

[19]  M. Artin,et al.  Société Mathématique de France , 1994 .

[20]  Patrick Lincoln,et al.  Linear logic , 1992, SIGA.

[21]  Furio Honsell,et al.  Operational, denotational and logical descriptions: a case study , 1992, Fundam. Informaticae.

[22]  Laurent Regnier,et al.  Lambda-calcul et reseaux , 1992 .

[23]  Eugenio Moggi,et al.  Computational lambda-calculus and monads , 1989, [1989] Proceedings. Fourth Annual Symposium on Logic in Computer Science.

[24]  M. Nivat.  Fiftieth volume of theoretical computer science , 1988 .

[25]  Henk Barendregt,et al.  The Lambda Calculus: Its Syntax and Semantics , 1985 .

[26]  Henk Barendregt,et al.  Solvability in lambda calculi , 1977 .

[27]  Christopher P. Wadsworth,et al.  The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus , 1976, SIAM J. Comput..

[28]  P. J. Landin,et al.  Correspondence between ALGOL 60 and Church's Lambda-notation , 1965, Commun. ACM.