• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 23 matches

• 1975
• 
  Luigia Carlucci Aiello, Mario Aiello:
  Programming language semantics in a typed lambda - calculus. Lambda-Calculus and Computer Science Theory 1975: 240-251
• 
  Giorgio Ausiello:
  On the description of time varying systems in lambda - calculus. Lambda-Calculus and Computer Science Theory 1975: 177-191
• 
  J. W. de Bakker:
  Least fixed points revisited. Lambda-Calculus and Computer Science Theory 1975: 27-61
• 
  Henk Barendregt:
  Normed uniformly reflexive structures. Lambda-Calculus and Computer Science Theory 1975: 272-286
• 
  Carlo Batini, Alberto Pettorossi:
  On subrecursiveness in weak combinatory logic. Lambda-Calculus and Computer Science Theory 1975: 297-311
• 
  Corrado Böhm, Mariangiola Dezani-Ciancaglini:
  Lambda-terms as total or partial functions on normal forms. Lambda-Calculus and Computer Science Theory 1975: 96-121
• 
  A. Dubinsky:
  Computation on arbitrary algebras. Lambda-Calculus and Computer Science Theory 1975: 319-341
• 
  Herbert Egli:
  Typed meaning in Scott's lambda - calculus models. Lambda-Calculus and Computer Science Theory 1975: 220-239
• 
  Gérard P. Huet:
  unification in typed lambda calculus. Lambda-Calculus and Computer Science Theory 1975: 192-212
• 
  J. M. E. Hyland:
  A survey of some useful partial order relations on terms of the lambda calculus. Lambda-Calculus and Computer Science Theory 1975: 83-95
• 
  Giuseppe Jacopini:
  A condition for identifying two elements of whatever model of combinatory logic. Lambda-Calculus and Computer Science Theory 1975: 213-219
• 
  Jan Willem Klop:
  On solvability by lambda I - terms. Lambda-Calculus and Computer Science Theory 1975: 342-345
• 
  Jean-Jacques Lévy:
  An algebraic interpretation of the lambda beta - calculus and a labeled lambda - calculus. Lambda-Calculus and Computer Science Theory 1975: 147-165
• 
  Reiji Nakajima:
  Infinite normal forms for the lambda - calculus. Lambda-Calculus and Computer Science Theory 1975: 62-82
• 
  Louis Nolin:
  Les modèles informatiques des lambda-calculus. Lambda-Calculus and Computer Science Theory 1975: 166-176
• 
  Vladimir Yu. Sazonov:
  Sequentially and parallelly computable functionals. Lambda-Calculus and Computer Science Theory 1975: 312-318
• 
  Dana S. Scott:
  Combinators and classes. Lambda-Calculus and Computer Science Theory 1975: 1-26
• 
  Dana S. Scott:
  Some philosophical issues concerning theories of combinators. Lambda-Calculus and Computer Science Theory 1975: 346-366
• 
  Roel C. de Vrijer:
  Big trees in a lambda - calculus with lambda - expressions as types. Lambda-Calculus and Computer Science Theory 1975: 252-271
• 
  Peter H. Welch:
  Continuous semantics and inside-out reductions. Lambda-Calculus and Computer Science Theory 1975: 122-146
• 
  Open problems. Lambda-Calculus and Computer Science Theory 1975: 367-370
• 
  Marisa Venturini Zilli:
  A model with nondeterministic computation. Lambda-Calculus and Computer Science Theory 1975: 287-296
• 
  Corrado Böhm:
  Lambda-Calculus and Computer Science Theory, Proceedings of the Symposium Held in Rome, Italy, March 25-27, 1975. Lecture Notes in Computer Science 37, Springer 1975, ISBN 3-540-07416-3 [contents]