|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 658 occurrences of 307 keywords
|
|
|
Results
Found 1386 publication records. Showing 1386 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
52 | Ugo Dal Lago, Simone Martini 0001 |
An Invariant Cost Model for the Lambda Calculus. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Paolo Coppola 0001, Ugo Dal Lago, Simona Ronchi Della Rocca |
Elementary Affine Logic and the Call-by-Value Lambda Calculus. |
TLCA |
2005 |
DBLP DOI BibTeX RDF |
|
52 | Antonio Bucciarelli, Antonino Salibra |
The Minimal Graph Model of Lambda Calculus. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
52 | Andrew K. Wright, Suresh Jagannathan, Cristian Ungureanu, Aaron Hertzmann |
Compiling Java to a Typed Lambda-Calculus: A Preliminary Report. |
Types in Compilation |
1998 |
DBLP DOI BibTeX RDF |
|
52 | Slawomir Lasota 0001, David Nowak, Yu Zhang |
On Completeness of Logical Relations for Monadic Types. |
ASIAN |
2006 |
DBLP DOI BibTeX RDF |
|
52 | Thomas Ehrhard, Laurent Regnier |
Böhm Trees, Krivine's Machine and the Taylor Expansion of Lambda-Terms. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
|
50 | Jesper Bengtson, Magnus Johansson, Joachim Parrow, Björn Victor |
Psi-calculi: Mobile Processes, Nominal Data, and Logic. |
LICS |
2009 |
DBLP DOI BibTeX RDF |
|
49 | Jerome Vouillon |
Subtyping Union Types. |
CSL |
2004 |
DBLP DOI BibTeX RDF |
semantics, lambda-calculus, subtyping, union types |
49 | Zoltán Csörnyei, Gergely Dévai |
An Introduction to the Lambda Calculus. |
CEFP |
2007 |
DBLP DOI BibTeX RDF |
|
48 | Silvio Valentini |
An elementary proof of strong normalization for intersection types. |
Arch. Math. Log. |
2001 |
DBLP DOI BibTeX RDF |
Normalization, Lambda calculus, Intersection types |
48 | Georg Struth |
Calculating Church-Rosser Proofs in Kleene Algebra. |
RelMiCS |
2001 |
DBLP DOI BibTeX RDF |
$lambda$-calculus, Church-Rosser theorem, rewriting, Kleene algebra, formal mathematics |
48 | Klaus Aehlig, Jan Johannsen, Helmut Schwichtenberg, Sebastiaan Terwijn |
Linear Ramified Higher Type Recursion and Parallel Complexity. |
Proof Theory in Computer Science |
2001 |
DBLP DOI BibTeX RDF |
higher types, parallel computation, recursion, linear logic, lambda calculus, implicit computational complexity, NC |
48 | Olivier Danvy, Morten Rhiger |
A Simple Take on Typed Abstract Syntax in Haskell-like Languages. |
FLOPS |
2001 |
DBLP DOI BibTeX RDF |
Type-directed partial evaluation, normalization functions, simply typed lambda-calculus, Haskell, higher-order abstract syntax |
48 | 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 |
48 | Anindya Banerjee 0001, Nevin Heintze, Jon G. Riecke |
Region Analysis and the Polymorphic Lambda Calculus. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
semantics, program analysis, garbage collection, memory management, polymorphism |
48 | Carolina Lavatelli |
Algebraic Interpretation of Lambda Calculus with Resources. |
CONCUR |
1996 |
DBLP DOI BibTeX RDF |
|
48 | Ian Mackie |
YALE: Yet Another Lambda Evaluator Based on Interaction Nets. |
ICFP |
1998 |
DBLP DOI BibTeX RDF |
|
47 | Zdzislaw Splawski, Pawel Urzyczyn |
Type Fixpoints: Iteration vs. Recursion. |
ICFP |
1999 |
DBLP DOI BibTeX RDF |
|
45 | Amr Sabry, Philip Wadler |
A Reflection on Call-by-Value. |
ACM Trans. Program. Lang. Syst. |
1997 |
DBLP DOI BibTeX RDF |
compiling, continuations, category theory, Galois connections |
45 | 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 |
45 | Gordon D. Plotkin, Matija Pretnar |
A Logic for Algebraic Effects. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
call-by-push-value, computational lambda-calculus, program logics, computational effects, algebraic operations |
45 | Philip Wadler |
Call-by-value is dual to call-by-name. |
ICFP |
2003 |
DBLP DOI BibTeX RDF |
Curry-Howard correspondence, De Morgan dual, lambda mu calculus, logic, lambda calculus, sequent calculus, natural deduction |
45 | Francisco Gutiérrez, Blas C. Ruiz |
A Cut-Free Sequent Calculus for Pure Type Systems Verifying the Structural Rules of Gentzen/Kleene. |
LOPSTR |
2002 |
DBLP DOI BibTeX RDF |
lambda calculus with types, pure type systems, cut elimination, sequent calculi |
45 | György E. Révész |
Rule-Based Semantics for an Extended Lambda-Calculus. |
MFPS |
1987 |
DBLP DOI BibTeX RDF |
|
45 | Rose H. Abdul Rauf, Ulrich Berger 0001, Anton Setzer |
A Provably Correct Translation of the lambda -Calculus into a Mathematical Model of C++. |
Theory Comput. Syst. |
2008 |
DBLP DOI BibTeX RDF |
Simply typed lambda-calculus, Kripke-style logical relation, Object-oriented programming, Functional programming, Inheritance, Denotational semantics, Correctness proof |
45 | Peter M. Kelly, Paul D. Coddington, Andrew L. Wendelborn |
Lambda Calculus as a Workflow Model. |
GPC Workshops |
2008 |
DBLP DOI BibTeX RDF |
workflow, lambda calculus |
45 | Sol Swords, William R. Cook |
Soundness of the simply typed lambda calculus in ACL2. |
ACL2 |
2006 |
DBLP DOI BibTeX RDF |
lambda-calculus, soundness, ACL2 |
45 | Marco Pedicini, Francesco Quaglia |
A parallel implementation for optimal lambda-calculus reduction. |
PPDP |
2000 |
DBLP DOI BibTeX RDF |
optimal reduction, virtual reduction, functional programming, linear logic, lambda calculus, parallel implementation, geometry of interaction |
45 | C.-H. Luke Ong |
Fully Abstract Models of the Lazy Lambda Calculus |
FOCS |
1988 |
DBLP DOI BibTeX RDF |
convergence testing, lazy lambda calculus, lazy languages, functional languages, proof theory, model theory, abstract models |
44 | John Power |
A Universal Embedding for the Higher Order Structure of Computational Effects. |
TLCA |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Paula Severi, Fer-Jan de Vries |
Continuity and Discontinuity in Lambda Calculus. |
TLCA |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Alex K. Simpson |
Reduction in a Linear Lambda-Calculus with Applications to Operational Semantics. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Sylvain Salvati, Philippe de Groote |
On the Complexity of Higher-Order Matching in the Linear lambda-Calculus. |
RTA |
2003 |
DBLP DOI BibTeX RDF |
|
44 | Norman Ramsey, Avi Pfeffer |
Stochastic lambda calculus and monads of probability distributions. |
POPL |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Peter Sestoft |
Demonstrating Lambda Calculus Reduction. |
The Essence of Computation |
2002 |
DBLP DOI BibTeX RDF |
|
44 | C.-H. Luke Ong |
Lazy Lambda Calculus: Theories, Models and Local Structure Characterization (Extended Abstract). |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
44 | Michel Parigot |
On the Representation of Data in Lambda-Calculus. |
CSL |
1989 |
DBLP DOI BibTeX RDF |
|
44 | Paula Severi, Fer-Jan de Vries |
Order Structures on Böhm-Like Models. |
CSL |
2005 |
DBLP DOI BibTeX RDF |
|
44 | Harry G. Mairson |
From Hilbert Spaces to Dilbert Spaces: Context Semantics Made Simple. |
FSTTCS |
2002 |
DBLP DOI BibTeX RDF |
|
44 | Frédéric Lang, Pierre Lescanne, Luigi Liquori |
A Framework for Defining Object-Calculi. |
World Congress on Formal Methods |
1999 |
DBLP DOI BibTeX RDF |
Design of functional and imperative object-oriented languages, memory management, operational semantics, implementation issues |
44 | Mitchell Wand |
Embedding Type Structure in Semantics. |
POPL |
1985 |
DBLP DOI BibTeX RDF |
|
42 | Horatiu Cirstea, Claude Kirchner, Luigi Liquori |
Matching Power. |
RTA |
2001 |
DBLP DOI BibTeX RDF |
|
41 | Tillmann Rendel, Klaus Ostermann, Christian Hofer |
Typed self-representation. |
PLDI |
2009 |
DBLP DOI BibTeX RDF |
self interpretation, reflection, types, lambda calculus, language design |
41 | Pierre-Louis Curien, Roberto Di Cosmo |
A Concluent Reduction for the Lambda-Calculus with Surjective Pairing and Terminal Object. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
41 | Daniel J. Dougherty |
Adding Algebraic Rewriting to the Untyped Lambda Calculus (Extended Abstract). |
RTA |
1991 |
DBLP DOI BibTeX RDF |
|
40 | José Espírito Santo, Ralph Matthes, Luís Pinto 0001 |
Inhabitation in simply typed lambda-calculus through a lambda-calculus for proof search. |
Math. Struct. Comput. Sci. |
2019 |
DBLP DOI BibTeX RDF |
|
40 | José Espírito Santo, Ralph Matthes, Luís Pinto 0001 |
Inhabitation in Simply-Typed Lambda-Calculus through a Lambda-Calculus for Proof Search. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
40 | Tom Gundersen, Willem Heijltjes, Michel Parigot |
Atomic Lambda Calculus: A Typed Lambda-Calculus with Explicit Sharing. |
LICS |
2013 |
DBLP DOI BibTeX RDF |
|
40 | Damiano Mazza |
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus. |
LICS |
2012 |
DBLP DOI BibTeX RDF |
|
40 | Chitta Baral, Marcos Alvarez Gonzalez, Aaron Gottesman |
The Inverse Lambda Calculus Algorithm for Typed First Order Logic Lambda Calculus and Its Application to Translating English to FOL. |
Correct Reasoning |
2012 |
DBLP DOI BibTeX RDF |
|
40 | Ken-etsu Fujita |
An interpretation of [lambda][mu]-calculus in [lambda]-calculus. |
Inf. Process. Lett. |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Andrea Asperti, Juliusz Chroboczek |
Safe Operators: Brackets Closed Forever Optimizing Optimal lambda-Calculus Implementations - Optimizing Optimal lambda-Calculus Implementations. |
Appl. Algebra Eng. Commun. Comput. |
1997 |
DBLP DOI BibTeX RDF |
Optimal reduction, Functional programming, Sharing |
40 | Jean-Jacques Lévy |
An Algebraic Interpretation of the lambda beta K-Calculus; and an Application of a Labelled lambda -Calculus. |
Theor. Comput. Sci. |
1976 |
DBLP DOI BibTeX RDF |
|
40 | Eike Ritter |
Characterising Explicit Substitutions which Preserve Termination. |
TLCA |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Patrick Baillot, Kazushige Terui |
Light Types for Polynomial Time Computation in Lambda-Calculus. |
LICS |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Andreas Abel 0001, Thorsten Altenkirch |
A Predicative Strong Normalisation Proof for a lambda-Calculus with Interleaving Inductive Types. |
TYPES |
1999 |
DBLP DOI BibTeX RDF |
|
40 | Kwanghoon Choi 0001, Atsushi Ohori |
A Type Theory for Krivine-Style Evaluation and Compilation. |
APLAS |
2004 |
DBLP DOI BibTeX RDF |
|
40 | Daniel J. Dougherty, Tomasz Wierzbicki |
A Decidable Variant of Higher Order Matching. |
RTA |
2002 |
DBLP DOI BibTeX RDF |
|
40 | Val Tannen, Jean H. Gallier |
Polymorphic Rewriting Conserves Algebraic Strong Normalization and Confluence. |
ICALP |
1989 |
DBLP DOI BibTeX RDF |
|
37 | Jeremy G. Siek, Ronald Garcia, Walid Taha |
Exploring the Design Space of Higher-Order Casts. |
ESOP |
2009 |
DBLP DOI BibTeX RDF |
|
37 | Marcelo P. Fiore |
Mathematical Models of Computational and Combinatorial Structures. |
FoSSaCS |
2005 |
DBLP DOI BibTeX RDF |
|
37 | Didier Rémy |
Projective ML. |
LISP and Functional Programming |
1992 |
DBLP DOI BibTeX RDF |
ML |
36 | Ugo Dal Lago |
The geometry of linear higher-order recursion. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
higher-order recursion, type systems, lambda calculus, implicit computational complexity, Geometry of interaction |
36 | Colin Stirling |
Dependency Tree Automata. |
FoSSaCS |
2009 |
DBLP DOI BibTeX RDF |
binding terms, Tree automata, typed lambda calculus |
36 | Makoto Tatsuta |
Types for Hereditary Permutators. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
hereditary permutator, infinite lambda-calculus, stream type, intersection type |
36 | Jean-Pierre Jouannaud, Albert Rubio |
Polymorphic higher-order recursive path orderings. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
Automated termination prover tool, Gödel's polymorphic recursor, higher-order rewriting, termination orderings, typed lambda calculus |
36 | Vasileios Koutavas, Mitchell Wand |
Small bisimulations for reasoning about higher-order imperative programs. |
POPL |
2006 |
DBLP DOI BibTeX RDF |
higher-order procedures, bisimulations, lambda-calculus, imperative languages, contextual equivalence |
36 | Colin Stirling |
A Game-Theoretic Approach to Deciding Higher-Order Matching. |
ICALP (2) |
2006 |
DBLP DOI BibTeX RDF |
higher-order matching, Games, typed lambda calculus |
36 | Christian Urban, Stefan Berghofer |
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL. |
IJCAR |
2006 |
DBLP DOI BibTeX RDF |
Lambda-calculus, proof assistants, nominal logic, primitive recursion |
36 | Colin Stirling |
Higher-Order Matching and Games. |
CSL |
2005 |
DBLP DOI BibTeX RDF |
higher-order matching, games, typed lambda calculus |
36 | Klaus Aehlig, Helmut Schwichtenberg |
A Syntactical Analysis of Non-Size-Increasing Polynomial Time Computation. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
affine linear typing, polynomial time computation, lambda-calculus |
36 | John Power, Edmund Robinson |
Logical Relations and Data Abstraction. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
cartesian closed fibrations, interpretations, lambda calculus, logical relations |
36 | David R. Lester, Sava Mintchev |
Towards Machine-Checked Compiler Correctness for Higher-order Pure Functional Languages. |
CSL |
1994 |
DBLP DOI BibTeX RDF |
Congruence Proof, Lambda Calculus, Denotational Semantics, Theorem Prover, Compiler Correctness |
36 | Uday S. Reddy |
Higher-order Aspects of Logic Programming. |
ELP |
1993 |
DBLP DOI BibTeX RDF |
Higher-order features, semantics, functional programming, types, lambda calculus, concurrent logic programming, logic variables |
36 | Michael V. Mannino, Injun Choi, Don S. Batory |
The Object-Oriented Functional Data Language. |
IEEE Trans. Software Eng. |
1990 |
DBLP DOI BibTeX RDF |
object-oriented functional data language, interactive strongly typed database programming language, O/sup 2/FDL, equational notation, strong typing, type restrictions, type variables, function interfaces, monotonic subtype rule, function redefinition, extended lambda -calculus, software engineering, software engineering, object oriented programming, object-oriented programming, functional programming, inheritance, operational semantics, object-oriented languages, relational algebra, encapsulation, high level languages, denotational semantics |
36 | Brent Hailpern, Tien Huynh, György E. Révész |
Comparing Two Functional Programming Systems. |
IEEE Trans. Software Eng. |
1989 |
DBLP DOI BibTeX RDF |
functional programming systems, graph reduction interpreter, DEL-style intermediate instruction set architecture, performance evaluation, benchmarks, functional programming, lambda calculus, functional languages, high level languages, execution times, performance comparison, FP, evaluation strategies, implementation language |
36 | Jai Prakash Gupta, Stephen C. Winter, Derek R. Wilson |
CTDNet-A Mechanism for the Concurrent Execution of Lambda Graphs. |
IEEE Trans. Software Eng. |
1989 |
DBLP DOI BibTeX RDF |
CTDNet, lambda graphs, data-driven reduction machine, applicative functional programs, lambda calculus expressions, binary-tree-structured process graphs, ancestor, master processes, slave processes, distributed eager evaluation scheme, conditional expressions, distributed string reduction, parallel programmingas, graph theory, children, parallel machines, pointers, concurrent execution, neighbors |
36 | Manfred Schmidt-Schauß, Elena Machkasova |
A Finite Simulation Method in a Non-deterministic Call-by-Need Lambda-Calculus with Letrec, Constructors, and Case. |
RTA |
2008 |
DBLP DOI BibTeX RDF |
|
36 | Marco Pedicini, Francesco Quaglia |
PELCR: Parallel environment for optimal lambda-calculus reduction. |
ACM Trans. Comput. Log. |
2007 |
DBLP DOI BibTeX RDF |
optimal reduction, virtual reduction, Functional programming, linear logic, parallel implementation, geometry of interaction |
36 | Sergei N. Artëmov, Eduardo Bonelli |
The Intensional Lambda Calculus. |
LFCS |
2007 |
DBLP DOI BibTeX RDF |
|
36 | Markus Lumpe |
A Lambda Calculus with Forms. |
SC@ETAPS |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Joachim Niehren, Jan Schwinghammer, Gert Smolka |
A Concurrent Lambda Calculus with Futures. |
FroCoS |
2005 |
DBLP DOI BibTeX RDF |
|
36 | Viviana Bono, Michele Bugliesi, Luigi Liquori |
A Lambda Calculus of Incomplete Objects. |
MFCS |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Roberto Di Cosmo, Delia Kesner |
Rewriting with Extensional Polymorphic Lambda-Calculus. |
CSL |
1995 |
DBLP DOI BibTeX RDF |
|
36 | Viviana Bono, Luigi Liquori |
A Subtyping for the Fisher-Honsell-Mitchell Lambda Calculus of Objects. |
CSL |
1994 |
DBLP DOI BibTeX RDF |
|
36 | David Sands 0001, Jörgen Gustavsson, Andrew Moran |
Lambda Calculi and Linear Speedups. |
The Essence of Computation |
2002 |
DBLP DOI BibTeX RDF |
|
36 | Richard Statman |
On Cartesian Monoids. |
CSL |
1996 |
DBLP DOI BibTeX RDF |
|
36 | Serge Abiteboul, Gerd G. Hillebrand |
Space Usage in Functional Query Languages. |
ICDT |
1995 |
DBLP DOI BibTeX RDF |
|
35 | Michael Beeson |
Lambda Logic. |
IJCAR |
2004 |
DBLP DOI BibTeX RDF |
|
35 | Kazuto Tominaga, Tomoya Suzuki, Kazuhiro Oka |
An Encoding Scheme for Generating lambda-Expressions in Genetic Programming. |
GECCO |
2003 |
DBLP DOI BibTeX RDF |
|
33 | Daisuke Kimura, Makoto Tatsuta |
Dual Calculus with Inductive and Coinductive Types. |
RTA |
2009 |
DBLP DOI BibTeX RDF |
|
32 | Yves Bertot |
A Short Presentation of Coq. |
TPHOLs |
2008 |
DBLP DOI BibTeX RDF |
|
32 | Malgorzata Biernacka, Olivier Danvy |
A concrete framework for environment machines. |
ACM Trans. Comput. Log. |
2007 |
DBLP DOI BibTeX RDF |
closures, derivation, Abstract machines, explicit substitutions |
32 | José Espírito Santo |
Delayed Substitutions. |
RTA |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Frédéric Loulergue |
A calculus of functional BSP programs with projection. |
IPDPS |
2006 |
DBLP DOI BibTeX RDF |
|
32 | Naoki Kobayashi 0001 |
A Partially Deadlock-Free Typed Process Calculus. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
32 | José Meseguer 0001 |
Relating Models of Polymorphism. |
POPL |
1989 |
DBLP DOI BibTeX RDF |
|
32 | Adam Chlipala |
A certified type-preserving compiler from lambda calculus to assembly language. |
PLDI |
2007 |
DBLP DOI BibTeX RDF |
denotational semantics, dependent types, compiler verification, interactive proof assistants |
32 | Peter Selinger, Benoît Valiron |
A Lambda Calculus for Quantum Computation with Classical Control. |
TLCA |
2005 |
DBLP DOI BibTeX RDF |
|
32 | Aleksy Schubert |
A Self-dependency Constraint in the Simply Typed Lambda Calculus. |
FCT |
2005 |
DBLP DOI BibTeX RDF |
|
Displaying result #101 - #200 of 1386 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ >>] |
|