|
|
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 |
32 | Yoriyuki Yamagata |
Strong normalization of a symmetric lambda calculus for second-order classical logic. |
Arch. Math. Log. |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Vincent Simonet |
Fine-Grained Information Flow Analysis for a \lambda Calculus with Sum Types. |
CSFW |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Dieter Spreen |
A New Model Construction for the Polymorphic Lambda Calculus. |
LPAR |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Furio Honsell, John Longley, Donald Sannella, Andrzej Tarlecki |
Constructive Data Refinement in Typed Lambda Calculus. |
FoSSaCS |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Allan Ramsay |
Theorem Proving for Constructive lambda-Calculus. |
AIMSA |
2000 |
DBLP DOI BibTeX RDF |
|
32 | Torben Æ. Mogensen |
Linear Time Self-Interpretation of the Pure Lambda Calculus. |
Ershov Memorial Conference |
1999 |
DBLP DOI BibTeX RDF |
|
32 | Kenichi Asai, Hidehiko Masuhara, Akinori Yonezawa |
Partial Evaluation of Call-by-Value lambda-Calculus with Side-Effects. |
PEPM |
1997 |
DBLP DOI BibTeX RDF |
|
32 | Dieter Hutter, Michael Kohlhase |
A Colored Version of the Lambda-Calculus. |
CADE |
1997 |
DBLP DOI BibTeX RDF |
|
32 | Martin Hofmann 0001 |
A Mixed Modal/Linear Lambda Calculus with Applications to Bellantoni-Cook Safe Recursion. |
CSL |
1997 |
DBLP DOI BibTeX RDF |
|
32 | John W. Gray |
Simultaneous Substitution in the Typed Lambda Calculus. |
MFPS |
1991 |
DBLP DOI BibTeX RDF |
|
32 | Albert R. Meyer, John C. Mitchell, Eugenio Moggi, Richard Statman |
Empty Types in Polymorphic Lambda Calculus. |
POPL |
1987 |
DBLP DOI BibTeX RDF |
|
32 | Paul Hudak, Jonathan Young |
Higher-Order Strictness Analysis in Untyped Lambda Calculus. |
POPL |
1986 |
DBLP DOI BibTeX RDF |
|
32 | J. Roger Hindley |
Combinators and Lambda-Calculus. |
Combinators and Functional Programming Languages |
1985 |
DBLP DOI BibTeX RDF |
|
32 | David A. Schmidt |
State transition machines for lambda calculus expressions. |
Semantics-Directed Compiler Generation |
1980 |
DBLP DOI BibTeX RDF |
|
32 | Claude Stolze |
Combining union, intersection and dependent types in an explicitly typed lambda-calculus. (Types union, intersection, et dépendants dans le lambda-calcul explicitement typé). |
|
2019 |
RDF |
|
32 | Pierre Vial |
Non-idempotent typing operators, beyond the lambda-calculus. (Opérateurs de typage non-idempotents, au delà du lambda-calcul). |
|
2017 |
RDF |
|
32 | M. H. van Emden |
The lambda mechanism in lambda calculus and in other calculi. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
32 | Lourdes Del Carmen González-Huesca |
Incrementality and effect simulation in the simply typed lambda calculus. (Incrémentalité et simulation d'effets dans le lambda calcul simplement typé). |
|
2015 |
RDF |
|
32 | Chitta Baral, Juraj Dzifcak, Marcos Alvarez Gonzalez, Aaron Gottesman |
Typed answer set programming lambda calculus theories and correctness of inverse lambda algorithms with respect to them. |
Theory Pract. Log. Program. |
2012 |
DBLP DOI BibTeX RDF |
|
32 | Barbara Petit |
On the lambda calculus with constructors. (Autour du lambda-calcul avec constructeurs). |
|
2011 |
RDF |
|
32 | Sébastien Hinderer |
Automatisation de la Construction Sémantique dans le Lambda Calcul Simplement Typé avec plusieurs Types de base. (Automating Semantic Construction in Simply Typed Lambda Calculus with Several Atomic Types). |
|
2008 |
RDF |
|
32 | Colin Riba |
Définitions par réécriture dans le lambda-calcul : confluence, réductibilité et typage. (Definitions by rewriting in the lambda-calculus : confluence, reducibility and typing). |
|
2007 |
RDF |
|
32 | Ferruccio Guidi |
Lambda Types on the Lambda Calculus with Abbreviations |
CoRR |
2006 |
DBLP BibTeX RDF |
|
32 | Tomasz Blanc |
Propriétés de sécurité dans le lambda-calcul. (Security Properties in the lambda-calculus). |
|
2006 |
RDF |
|
32 | Loïc Colson, Natasa Jonoska, Maurice Margenstern |
lambda-P Systems and Typed lambda-Calculus. |
Workshop on Membrane Computing |
2004 |
DBLP DOI BibTeX RDF |
|
32 | Georges Mounier |
Un lambda calcul intuitioniste avec exceptions. (an intuitionistic lambda calculus with exceptions). |
|
1999 |
RDF |
|
32 | Don Pigozzi, Antonino Salibra |
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus. |
Fundam. Informaticae |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Rainer Kerth |
The Interpretation of Unsolvable lambda-Terms in Models of Untyped lambda-Calculus. |
J. Symb. Log. |
1998 |
DBLP DOI BibTeX RDF |
|
32 | Don Pigozzi, Antonino Salibra |
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus. |
Fundam. Informaticae |
1997 |
DBLP DOI BibTeX RDF |
|
32 | Silvia Ghilezan |
Application of Typed Lambda Calculi in the Untyped Lambda Calculus. |
LFCS |
1994 |
DBLP DOI BibTeX RDF |
|
32 | Furio Honsell, Simona Ronchi Della Rocca |
An Approximation Theorem for Topological Lambda Models and the Topological Incompleteness of Lambda Calculus. |
J. Comput. Syst. Sci. |
1992 |
DBLP DOI BibTeX RDF |
|
32 | Matthias Felleisen |
lambda-V-CS: An Extended lambda-Calculus for Scheme. |
LISP and Functional Programming |
1988 |
DBLP DOI BibTeX RDF |
SCHEME |
32 | Robert Pieter Nederpelt Lazarom |
Strong normalization in a typed lambda calculus with lambda structured types. |
|
1973 |
RDF |
|
32 | Marco Gaboardi, Jean-Yves Marion, Simona Ronchi Della Rocca |
A logical account of pspace. |
POPL |
2008 |
DBLP DOI BibTeX RDF |
type assignment, linear logic, implicit computational complexity, polynomial space |
32 | Davide Sangiorgi, Naoki Kobayashi 0001, Eijiro Sumii |
Environmental Bisimulations for Higher-Order Languages. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
32 | Sandra Alves, Mário Florido |
Linearization by Program Transformation. |
LOPSTR |
2003 |
DBLP DOI BibTeX RDF |
|
32 | Richard Statman |
On The Lambda Y Calculus. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Paula Severi, Fer-Jan de Vries |
An Extensional Böhm Model. |
RTA |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Matthias M. Hölzl, John N. Crossley |
Constraint-Lambda Calculi. |
FroCoS |
2002 |
DBLP DOI BibTeX RDF |
|
32 | Hans Leiß |
Second-Order Pre-Logical Relations and Representation Independence. |
TLCA |
2001 |
DBLP DOI BibTeX RDF |
|
32 | Julia L. Lawall, Harry G. Mairson |
on Global Dynamics of Optimal Graph Reduction. |
ICFP |
1997 |
DBLP DOI BibTeX RDF |
|
29 | Martin Wirsing, John N. Crossley, Hannes Peterreins |
Proof Normalization of Structured Algebraic Specifications Is Convergent. |
WADT |
1998 |
DBLP DOI BibTeX RDF |
|
29 | Thomas Ehrhard, Giulio Guerrieri |
The Bang Calculus: an untyped lambda-calculus generalizing call-by-name and call-by-value. |
PPDP |
2016 |
DBLP DOI BibTeX RDF |
|
29 | Mirna Bognar, Roel C. de Vrijer |
A Calculus of Lambda Calculus Contexts. |
J. Autom. Reason. |
2001 |
DBLP DOI BibTeX RDF |
|
29 | Gérard Boudol, Cosimo Laneve |
lambda-calculus, multiplicities, and the pi-calculus. |
Proof, Language, and Interaction |
2000 |
DBLP BibTeX RDF |
|
29 | Fairouz Kamareddine, Alejandro Ríos 0001 |
Extending a lambda-Calculus with Explicit Substitution which Preserves Strong Normalisation Into a Confluent Calculus on Open Terms. |
J. Funct. Program. |
1997 |
DBLP DOI BibTeX RDF |
|
29 | Roberto M. Amadio, Lone Leth Thomsen, Bent Thomsen |
From a Concurrent Lambda-Calculus to the Pi-Calculus. |
FCT |
1995 |
DBLP DOI BibTeX RDF |
|
29 | Hugo Herbelin |
A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure. |
CSL |
1994 |
DBLP DOI BibTeX RDF |
|
28 | Ken-etsu Fujita |
A Sound and Complete CPS-Translation for lambda-mu-Calculus. |
TLCA |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Seikoh Mikami, Yohji Akama |
A Study of Abramsky's Linear Chemical Abstract Machine. |
TLCA |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Rosa M. Jiménez, Fernando Orejas |
An Algebraic Framework for Higher-Order Modules. |
World Congress on Formal Methods |
1999 |
DBLP DOI BibTeX RDF |
|
28 | John Power, Hayo Thielecke |
Closed Freyd- and kappa-categories. |
ICALP |
1999 |
DBLP DOI BibTeX RDF |
|
28 | Luigi Liquori |
On Object Extension. |
ECOOP |
1998 |
DBLP DOI BibTeX RDF |
|
28 | Robert E. Bruccoleri |
WRAPGEN - A Tool for the Use of Fortran and C Together in Portable Programs. |
ACM SIGPLAN Notices |
1996 |
DBLP DOI BibTeX RDF |
FORTRAN C |
28 | Loe M. G. Feijs |
The Calculus lambda-pi. |
Algebraic Methods |
1987 |
DBLP DOI BibTeX RDF |
|
28 | Koji Nakazawa, Makoto Tatsuta, Yukiyoshi Kameyama, Hiroshi Nakano |
Undecidability of Type-Checking in Domain-Free Typed Lambda-Calculi with Existence. |
CSL |
2008 |
DBLP DOI BibTeX RDF |
domain-free type system, undecidability, existential type, CPS-translation |
28 | Patrick Baillot |
From Proof-Nets to Linear Logic Type Systems for Polynomial Time Computing. |
TLCA |
2007 |
DBLP DOI BibTeX RDF |
|
28 | Daniel Leivant |
Calibrating Computational Feasibility by Abstraction Rank. |
LICS |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Chuck C. Liang, Gopalan Nadathur |
Tradeoffs in the Intensional Representation of Lambda Terms. |
RTA |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Julien Forest |
A Weak Calculus with Explicit Operators for Pattern Matching and Substitution. |
RTA |
2002 |
DBLP DOI BibTeX RDF |
|
28 | Shin-ya Katsumata, Atsushi Ohori |
Proof-Directed De-compilation of Low-Level Code. |
ESOP |
2001 |
DBLP DOI BibTeX RDF |
|
28 | Mariangiola Dezani-Ciancaglini, Jerzy Tiuryn, Pawel Urzyczyn |
Discrimination by Parallel Observers. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
28 | Martín Abadi, Butler W. Lampson, Jean-Jacques Lévy |
Analysis and Caching of Dependencies. |
ICFP |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Jan Schwinghammer |
On Normalization by Evaluation for Object Calculi. |
TYPES |
2007 |
DBLP DOI BibTeX RDF |
|
25 | John Field, Carlos A. Varela |
Transactors: a programming model for maintaining globally consistent distributed state in unreliable environments. |
POPL |
2005 |
DBLP DOI BibTeX RDF |
distributed state, tau-calculus, transactor, actor |
25 | Ichiro Ogata |
A Proof Theoretical Account of Continuation Passing Style. |
CSL |
2002 |
DBLP DOI BibTeX RDF |
Classical Natural Deduction, LKQ, classical proof theory, Classical Logic, CPS-translation, Call-By-Value |
25 | Jean-Louis Krivine |
The Curry-Howard Correspondence in Set Theory. |
LICS |
2000 |
DBLP DOI BibTeX RDF |
|
24 | Thomas Ehrhard |
A Finiteness Structure on Resource Terms. |
LICS |
2010 |
DBLP DOI BibTeX RDF |
finiteness spaces, algebraic system F, linear logic, lambda-calculus, reducibility, denotational semantics |
24 | Jeremy G. Siek, Philip Wadler |
Threesomes, with and without blame. |
POPL |
2010 |
DBLP DOI BibTeX RDF |
blame tracking, lambda-calculus, coercions, casts |
24 | Stefano Guerrini, Andrea Masini |
Proofs, tests and continuation passing style. |
ACM Trans. Comput. Log. |
2009 |
DBLP DOI BibTeX RDF |
Minimal logic, call-by-name, intutionistic logic, linear logic, lambda calculus, continuations passing style, call-by-value |
24 | Benoît Montagu, Didier Rémy |
Modeling abstract types in modules with open existential types. |
POPL |
2009 |
DBLP DOI BibTeX RDF |
linear type systems, modularity, generativity, type systems, modules, lambda-calculus, abstract types, existential types |
24 | Thomas Anberrée |
First-Order Universality for Real Programs. |
CiE |
2009 |
DBLP DOI BibTeX RDF |
real number computation, simply typed lambda-calculus, computability, denotational semantics |
24 | Jeremy G. Siek, Manish Vachharajani |
Gradual typing with unification-based inference. |
DLS |
2008 |
DBLP DOI BibTeX RDF |
gradual typing, simply typed lambda calculus, type inference, unification, dynamic typing, static typing |
24 | Guillaume Burel |
A First-Order Representation of Pure Type Systems Using Superdeduction. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
lambda-calculus with explicit substitutions, natural deduction vs. sequent calculus, first-order logic, logical frameworks, deduction modulo |
24 | Søren B. Lassen, Paul Blain Levy |
Typed Normal Form Bisimulation for Parametric Polymorphism. |
LICS |
2008 |
DBLP DOI BibTeX RDF |
LTS, bisimulation, parametric polymorphism, typed lambda calculus |
24 | Aleksander Wojdyga |
Short Proofs of Strong Normalization. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
permutative reductions, lambda calculus, system F, CPS-translation, strong normalization |
24 | Franck Binard, Amy P. Felty |
Genetic programming with polymorphic types and higher-order functions. |
GECCO |
2008 |
DBLP DOI BibTeX RDF |
genetic programming, polymorphism, types, lambda calculus |
24 | Donald Sofge |
A Survey of Quantum Programming Languages: History, Methods, and Tools. |
ICQNM |
2008 |
DBLP DOI BibTeX RDF |
functional programming, quantum computing, linear logic, lambda calculus, imperative programming |
24 | Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine |
Principal Typings for Explicit Substitutions Calculi. |
CiE |
2008 |
DBLP DOI BibTeX RDF |
lambda-calculus, explicit substitution, principal typings |
24 | Eijiro Sumii, Benjamin C. Pierce |
A bisimulation for type abstraction and recursion. |
J. ACM |
2007 |
DBLP DOI BibTeX RDF |
bisimulations, Lambda-calculus, logical relations, recursive types, existential types, contextual equivalence |
24 | David A. Schmidt |
State-transition machines, revisited. |
High. Order Symb. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Krivine machine, Lambda-calculus, Denotational semantics, Continuation-passing style, Defunctionalization |
24 | Mitchell Wand |
On the correctness of the Krivine machine. |
High. Order Symb. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Krivine machine, Weak head reduction, Lambda calculus |
24 | Daniel P. Friedman, Abdulaziz Ghuloum, Jeremy G. Siek, Onnie Lynn Winebarger |
Improving the lazy Krivine machine. |
High. Order Symb. Comput. |
2007 |
DBLP DOI BibTeX RDF |
Call by need, Lambda calculus, Lazy evaluation, Abstract machine |
24 | Sabine Broda, Luís Damas |
On Principal Types of BCK- lambda -Terms. |
WoLLIC |
2007 |
DBLP DOI BibTeX RDF |
condensed BCK-logic, Typed lambda-calculus, principal types |
24 | Dariusz Kusmierek |
The Inhabitation Problem for Rank Two Intersection Types. |
TLCA |
2007 |
DBLP DOI BibTeX RDF |
type inhabitation problem, lambda calculus, intersection types, alternating Turing machine |
24 | Matthew Might |
Logic-flow analysis of higher-order programs. |
POPL |
2007 |
DBLP DOI BibTeX RDF |
LFA, abstract counting, abstract garbage collection, environment analysis, gamma-CFA first-order logic, logic-flow analysis, static analysis, theorem proving, lambda calculus, CPS |
24 | Franck Binard, Amy P. Felty |
An abstraction-based genetic programming system. |
GECCO (Companion) |
2007 |
DBLP DOI BibTeX RDF |
genetic programming, polymorphism, types, lambda calculus |
24 | Chantal Berline, Giulio Manzonetto, Antonino Salibra |
Lambda Theories of Effective Lambda Models. |
CSL |
2007 |
DBLP DOI BibTeX RDF |
Effective lambda models, Recursively enumerable lambda theories, Löwenheim-Skolem theorem, Lambda calculus, Graph models |
24 | Ulrich Berger 0001, Stefan Berghofer, Pierre Letouzey, Helmut Schwichtenberg |
Program Extraction from Normalization Proofs. |
Stud Logica |
2006 |
DBLP DOI BibTeX RDF |
Normalization by evaluation, program extraction from proofs, realizability, typed lambda calculus |
24 | Paul Blain Levy |
Call-by-push-value: Decomposing call-by-value and call-by-name. |
High. Order Symb. Comput. |
2006 |
DBLP DOI BibTeX RDF |
Call-by-push-value, Call-by-name, Lambda-calculus, Monad, Computational effect, Call-by-value |
24 | Matthew Might, Olin Shivers |
Environment analysis via Delta CFA. |
POPL |
2006 |
DBLP DOI BibTeX RDF |
delta-CFA, environment analysis, super-beta, program analysis, continuations, lambda calculus, functional languages, flow analysis, CPS, inlining |
24 | Matthew Might, Olin Shivers |
Improving flow analyses via GammaCFA: abstract garbage collection and counting. |
ICFP |
2006 |
DBLP DOI BibTeX RDF |
abstract counting, abstract garbage collection, environment analysis, gamma-CFA, superbeta, program analysis, continuations, lambda calculus, functional languages, flow analysis, CPS, inlining |
24 | Maria Emilia Maietti, Paola Maneggia, Valeria de Paiva, Eike Ritter |
Relating Categorical Semantics for Intuitionistic Linear Logic. |
Appl. Categorical Struct. |
2005 |
DBLP DOI BibTeX RDF |
intuitionistic linear logic, symmetric monoidal closed categories, symmetric monoidal adjunctions, typed lambda calculus |
24 | Mayer Goldberg |
A Variadic Extension of Curry's Fixed-Point Combinator. |
High. Order Symb. Comput. |
2005 |
DBLP DOI BibTeX RDF |
fixed-point combinators, applicative order, variadic functions, Scheme, lambda-calculus, fixed points |
24 | Eijiro Sumii, Benjamin C. Pierce |
A bisimulation for type abstraction and recursion. |
POPL |
2005 |
DBLP DOI BibTeX RDF |
bisimulations, lambda-calculus, logical relations, recursive types, existential types, contextual equivalence |
24 | Olin Shivers |
The anatomy of a loop: a story of scope and control. |
ICFP |
2005 |
DBLP DOI BibTeX RDF |
compilers, programming languages, functional programming, scheme, continuations, lambda-calculus, iteration, macros, control structures |
24 | Neelakantan R. Krishnaswami, Jonathan Aldrich |
Permission-based ownership: encapsulating state in higher-order typed languages. |
PLDI |
2005 |
DBLP DOI BibTeX RDF |
modularity, lambda calculus, type theory, state, domains, ownership types, permissions, system f |
24 | Pawel T. Wojciechowski |
Isolation-only transactions by typing and versioning. |
PPDP |
2005 |
DBLP DOI BibTeX RDF |
declarative synchronization, singleton kinds, concurrency, programming languages, transactions, lambda calculus, type theory, isolation, abstract types |
24 | Philippe de Groote, Sylvain Pogodalla |
On the Expressive Power of Abstract Categorial Grammars: Representing Context-Free Formalisms. |
J. Log. Lang. Inf. |
2004 |
DBLP DOI BibTeX RDF |
Abstract categorial grammars, lambda-calculus, context-free grammars, formal language theory |
24 | Olin Shivers, David Fisher |
Multi-return function call. |
ICFP |
2004 |
DBLP DOI BibTeX RDF |
compilers, programming languages, functional programming, continuations, lambda calculus, control structures, procedure call |
Displaying result #201 - #300 of 1386 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ >>] |
|