|
|
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 |
24 | Stephen Tse, Steve Zdancewic |
Translating dependency into parametricity. |
ICFP |
2004 |
DBLP DOI BibTeX RDF |
DCC, protection contexts, security, dependency, Haskell, information flow, translation, polymorphism, lambda calculus, monads, parametricity, noninterference, logical relations |
24 | Sébastien Carlier, J. B. Wells |
Type inference with expansion variables and intersection types in system E and an exact correspondence with beta-reduction. |
PPDP |
2004 |
DBLP DOI BibTeX RDF |
expansion variables, type inference, lambda-calculus, intersection types |
24 | Mariangiola Dezani-Ciancaglini, Furio Honsell, Fabio Alessi |
A complete characterization of complete intersection-type preorders. |
ACM Trans. Comput. Log. |
2003 |
DBLP DOI BibTeX RDF |
lambda models, completeness, Lambda calculus, intersection types |
24 | Gilles Barthe, Horatiu Cirstea, Claude Kirchner, Luigi Liquori |
Pure patterns type systems. |
POPL |
2003 |
DBLP DOI BibTeX RDF |
Curry-Howard, pure type systems, patterns, matching, logics, Lambda-calculus, rewriting |
24 | James J. Leifer, Gilles Peskine, Peter Sewell, Keith Wansbrough |
Global abstraction-safe marshalling with hash types. |
ICFP |
2003 |
DBLP DOI BibTeX RDF |
singleton kinds, programming languages, ML, distributed programming, modules, hashing, lambda calculus, type theory, abstract types, serialisation, marshalling |
24 | 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 |
24 | Aleksandar Nanevski |
From dynamic binding to state via modal possibility. |
PPDP |
2003 |
DBLP DOI BibTeX RDF |
modal lambda-calculus, state, dynamic binding, effect systems |
24 | Klaus Aehlig, Helmut Schwichtenberg |
A syntactical analysis of non-size-increasing polynomial time computation. |
ACM Trans. Comput. Log. |
2002 |
DBLP DOI BibTeX RDF |
Complexity, linear logic, lambda calculus |
24 | Aleksandar Nanevski |
Meta-programming with names and necessity. |
ICFP |
2002 |
DBLP DOI BibTeX RDF |
modal lambda-calculus, higher-order abstract syntax |
24 | Russell A. Martin, Dana Randall |
Sampling Adsorbing Staircase Walks Using a New Markov Chain Decomposition Method. |
FOCS |
2000 |
DBLP DOI BibTeX RDF |
adsorbing staircase walks, Markov chain decomposition method, lattice paths, diagonal steps, local Markov chain, /spl lambda//sup /spl kappa//, Gibbs measure, first proof, statistical physics community, Markov chain, theorem proving, Markov processes, lambda calculus, state space, decomposition technique |
24 | Mauricio Ayala-Rincón, Fairouz Kamareddine |
Unification via se-style of explicit substitution. |
PPDP |
2000 |
DBLP DOI BibTeX RDF |
higher order unification, lambda-calculus, explicit substitution |
24 | Marcelo P. Fiore, Gordon D. Plotkin, Daniele Turi |
Abstract Syntax and Variable Binding. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
categorical models and logics, type theory and type systems, semantics, lambda calculus, abstract syntax, universal algebra, variable binding |
24 | A. J. Kfoury, Santiago M. Pericás-Geertsen |
Type Inference for Recursive Definitions. |
LICS |
1999 |
DBLP DOI BibTeX RDF |
type systems, type inference, lambda calculus, unification, software specification |
24 | Thomas P. Jensen |
Disjunctive Program Analysis for Algebraic Data Types. |
ACM Trans. Program. Lang. Syst. |
1997 |
DBLP DOI BibTeX RDF |
abstract interpretaton, binding-time and data-flow analysis, nonstandard type systems, lambda calculus, strictness analysis |
24 | Hongwei Xi |
Evaluation Under Lambda Abstraction. |
PLILP |
1997 |
DBLP DOI BibTeX RDF |
partial evaluation, lambda-calculus, run-time code generation |
24 | Allyn Dimock, Robert Muller, Franklyn A. Turbak, J. B. Wells |
Strongly Typed Flow-Directed Representation Transformations. |
ICFP |
1997 |
DBLP DOI BibTeX RDF |
intersection and union types, typed flow analysis, compilation, lambda calculus, inlining, closure conversion |
24 | Zine-El-Abidine Benaissa, Pierre Lescanne, Kristoffer Høgsbro Rose |
Modeling Sharing and Recursion for Weak Reduction Strategies Using Explicit Substitution. |
PLILP |
1996 |
DBLP DOI BibTeX RDF |
Implementation of functional programming, weak reduction, space leaks, recursion, sharing, lambda calculus, explicit substitution |
24 | Robert Harper 0001, Furio Honsell, Gordon D. Plotkin |
A Framework for Defining Logics. |
J. ACM |
1993 |
DBLP DOI BibTeX RDF |
proof checking, interactive theorem proving, typed lambda calculus, formal systems |
24 | Roberto M. Amadio, Luca Cardelli |
Subtyping Recursive Types. |
ACM Trans. Program. Lang. Syst. |
1993 |
DBLP DOI BibTeX RDF |
partial-equivalence relations, regular trees, tree orderings, type equivalence, typechecking algorithm, lambda-calculus, subtyping, recursive types, coercions |
24 | Dexter Kozen, Jens Palsberg, Michael I. Schwartzbach |
Efficient Inference of Partial Types |
FOCS |
1992 |
DBLP DOI BibTeX RDF |
partial types, heterogeneous lists, persistent data, exponential time algorithm, type inference, decidability, lambda -calculus, recursive types, finite automaton, type constraints |
24 | Leen Helmink |
Resolution and Type Theory. |
ESOP |
1990 |
DBLP DOI BibTeX RDF |
Calculus of Constructions, Type Theory, Natural Deduction, Typed Lambda Calculus |
24 | Glynn Winskel |
An introduction to event structures. |
REX Workshop |
1988 |
DBLP DOI BibTeX RDF |
higher types, Petri nets, parallel computation, semantics, concurrency, traces, lambda calculus, nondeterminism, communicating processes, Event structures |
24 | Rafael Dueire Lins |
A New Formula for the Execution of Categorial Combinators. |
CADE |
1986 |
DBLP DOI BibTeX RDF |
Categorical Combinators, complexity, functional programming, lambda calculus |
24 | Malgorzata Biernacka, Olivier Danvy |
Towards Compatible and Interderivable Semantic Specifications for the Scheme Programming Language, Part II: Reduction Semantics and Abstract Machines. |
Semantics and Algebraic Specification |
2009 |
DBLP DOI BibTeX RDF |
|
24 | Colin Riba |
Strong Normalization as Safe Interaction. |
LICS |
2007 |
DBLP DOI BibTeX RDF |
|
24 | Sam Tobin-Hochstadt, Matthias Felleisen |
Interlanguage migration: from scripts to programs. |
OOPSLA Companion |
2006 |
DBLP DOI BibTeX RDF |
interlanguage migration, contract, ?-calculus, module systems |
24 | Sean A. Fulop |
Semantic Bootstrapping of Type-Logical Grammar. |
J. Log. Lang. Inf. |
2005 |
DBLP DOI BibTeX RDF |
|
24 | Jordan Zashev |
Diagonal fixed points in algebraic recursion theory. |
Arch. Math. Log. |
2005 |
DBLP DOI BibTeX RDF |
Algebraic recursion theory-Combinatory logic |
24 | Yuki Chiba, Takahito Aoto 0001, Yoshihito Toyama |
Program transformation by templates based on term rewriting. |
PPDP |
2005 |
DBLP DOI BibTeX RDF |
inductive theorem proving, tree homomorphism, program transformation, term rewriting |
24 | Martin Erwig, Deling Ren |
Programming Type-Safe Program Updates. |
ESOP |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Jo Erskine Hannay, Shin-ya Katsumata, Donald Sannella |
Semantic and Syntactic Approaches to Simulation Relations. |
MFCS |
2003 |
DBLP DOI BibTeX RDF |
|
24 | François-Régis Sinot, Maribel Fernández, Ian Mackie |
Efficient Reductions with Director Strings. |
RTA |
2003 |
DBLP DOI BibTeX RDF |
|
24 | Shin-ya Katsumata |
Behavioural Equivalence and Indistinguishability in Higher-Order Typed Languages. |
WADT |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Paul-André Melliès |
Axiomatic Rewriting Theory VI Residual Theory Revisited. |
RTA |
2002 |
DBLP DOI BibTeX RDF |
|
24 | Olivier Danvy |
Many Happy Returns. |
TLCA |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Dana S. Scott |
A New Category for Semantics. |
MFCS |
2001 |
DBLP DOI BibTeX RDF |
|
24 | Ken-etsu Fujita |
Explicitly Typed lambda µ-Calculus for Polymorphism an Call-by-Value. |
TLCA |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Olaf Chitil |
Type Inference Builds a Short Cut to Deforestation. |
ICFP |
1999 |
DBLP DOI BibTeX RDF |
|
24 | Yongqiang Sun, Kai Lin, Yijia Chen |
Automatic Generation of Parallel Compiler-Partial Evaluation of Parallel Lambda Language . |
APDC |
1997 |
DBLP DOI BibTeX RDF |
|
24 | Dirk Dussart, John Hughes, Peter Thiemann 0001 |
Type Specialization for Imperative Languages. |
ICFP |
1997 |
DBLP DOI BibTeX RDF |
program transformation, type systems, monads, specialisation |
24 | Farooq Butt |
Porting the mcc PowerPC C/C++ Compiler into an Interactive Development Environment. |
ACM SIGPLAN Notices |
1996 |
DBLP DOI BibTeX RDF |
C++ |
24 | Charles D. Norton |
The International Workshop on Parallel C++ (IWPC++), Kanazawa, Ishikawa Prefecture, Japan. |
ACM SIGPLAN Notices |
1996 |
DBLP DOI BibTeX RDF |
C++ |
24 | Marko C. J. D. van Eekelen, Sjaak Smetsers, Marinus J. Plasmeijer |
Graph Rewriting Semantics for Functional Programming Languages. |
CSL |
1996 |
DBLP DOI BibTeX RDF |
|
24 | Richard Kennaway, Jan Willem Klop, M. Ronan Sleep, Fer-Jan de Vries |
Infinitary Lambda Calculi and Böhm Models. |
RTA |
1995 |
DBLP DOI BibTeX RDF |
|
24 | QingMing Ma, John C. Reynolds |
Types, Abstractions, and Parametric Polymorphism, Part 2. |
MFPS |
1991 |
DBLP DOI BibTeX RDF |
|
24 | Harry G. Mairson |
Deciding ML Typability is Complete for Deterministic Exponential Time. |
POPL |
1990 |
DBLP DOI BibTeX RDF |
ML |
24 | Carsten K. Gomard |
Partial Type Inference for Untyped Functional Programs. |
LISP and Functional Programming |
1990 |
DBLP DOI BibTeX RDF |
|
24 | Val Tannen, Thierry Coquand |
Extensional Models for Polymorphism. |
TAPSOFT, Vol.2 |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Kim B. Bruce, Jon G. Riecke |
The Semantics of Miranda's Algebraic Types. |
MFPS |
1987 |
DBLP DOI BibTeX RDF |
|
24 | Dan R. Olsen |
A Subset Algorithm for Deterministic FSMs within Deterministic PDAs. |
ACM SIGPLAN Notices |
1983 |
DBLP DOI BibTeX RDF |
|
20 | Atsushi Ohori |
A proof theory for machine code. |
ACM Trans. Program. Lang. Syst. |
2007 |
DBLP DOI BibTeX RDF |
Curry-Howard isomorphism |
20 | Stephan Ellner, Walid Taha |
The semantics of graphical languages. |
PEPM |
2007 |
DBLP DOI BibTeX RDF |
|
20 | 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 |
20 | C. Barry Jay, Delia Kesner |
Pure Pattern Calculus. |
ESOP |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Martín Abadi |
Access control in a core calculus of dependency. |
ICFP |
2006 |
DBLP DOI BibTeX RDF |
authorization, types |
20 | Roy Dyckhoff, Stéphane Lengrand |
LJQ: A Strongly Focused Calculus for Intuitionistic Logic. |
CiE |
2006 |
DBLP DOI BibTeX RDF |
purification, call-by-value semantics, depth-bounded, guarded logic, Sequent calculus, focused |
20 | Masahito Hasegawa |
Semantics of Linear Continuation-Passing in Call-by-Name. |
FLOPS |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Benjamin C. Pierce, Davide Sangiorgi |
Behavioral equivalence in the polymorphic pi-calculus. |
J. ACM |
2000 |
DBLP DOI BibTeX RDF |
abstract data types, pi-calculus |
20 | Zhong Shao |
Transparent Modules with Fully Syntactic Signatures. |
ICFP |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Gérard Boudol, Silvano Dal-Zilio |
An Interpretation of Extensible Objects. |
FCT |
1999 |
DBLP DOI BibTeX RDF |
|
20 | Yuxi Fu |
A Proof Theoretical Approach to Communication. |
ICALP |
1997 |
DBLP DOI BibTeX RDF |
|
20 | Radha Jagadeesan, Prakash Panangaden |
A Domain-Theoretic Model for a Higher-Order Process Calculus. |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
|
20 | Tsung-Min Kuo, Prateek Mishra |
On Strictness and its Analysis. |
POPL |
1987 |
DBLP DOI BibTeX RDF |
ML |
20 | Maximilien Mackie |
Recursion-free modular arithmetic in the lambda-calculus. |
Inf. Process. Lett. |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Alejandro Díaz-Caro, Octavio Malherbe |
A concrete model for a typed linear algebraic lambda calculus. |
Math. Struct. Comput. Sci. |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Vincent Moreau |
Profinite trees, through monads and the lambda-calculus. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Fairouz Kamareddine |
Substitution in the lambda Calculus and the role of the Curry School. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Radha Jagadeesan |
(Towards a) Statistical Probabilistic Lazy Lambda Calculus. |
CoRR |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Davide Barbarossa, Paolo Pistone |
Tropical Mathematics and the Lambda-Calculus I: Metric and Differential Analysis of Effectful Programs. |
CSL |
2024 |
DBLP DOI BibTeX RDF |
|
20 | Wenjia Ye, Matías Toro, Federico Olmedo |
A Gradual Probabilistic Lambda Calculus. |
Proc. ACM Program. Lang. |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Francesco A. Genco, Giuseppe Primiero |
A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Delia Kesner, Shane Ó Conchúir |
Milner's Lambda-Calculus with Partial Substitutions. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Fredrik Dahlqvist, Renato Neves |
A Complete V-Equational System for Graded lambda-Calculus. |
MFPS |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Sara Ayhan |
Meaning and identity of proofs in a bilateralist setting: A two-sorted typed lambda-calculus for proofs and refutations. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Matteo Acclavio, Davide Catta, Federico Olimpieri |
Canonicity in Modal Lambda Calculus. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | João M. Flach, Luís C. Lamb |
A Neural Lambda Calculus: Neurosymbolic AI meets the foundations of computing and functional programming. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Davide Barbarossa, Paolo Pistone |
Tropical Mathematics and the Lambda Calculus I: Metric and Differential Analysis of Effectful Programs. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Brando Miranda, Avi Shinnar, Vasily Pestun, Barry M. Trager |
Transformer Models for Type Inference in the Simply Typed Lambda Calculus: A Case Study in Deep Learning for Code. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Tatsuya Abe 0001, Daisuke Kimura |
A typed lambda-calculus with first-class configurations. |
J. Log. Comput. |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Wouter Swierstra |
A correct-by-construction conversion from lambda calculus to combinatory logic. |
J. Funct. Program. |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Shin-ya Nishizaki |
Transplanting of Environments between Closures in the lambda calculus. |
ICSCA |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Friedrich Steimann |
A Simply Numbered Lambda Calculus. |
Eelco Visser Commemorative Symposium |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Giulio Manzonetto |
A Lambda Calculus Satellite (Invited Talk). |
FSCD |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Thorsten Altenkirch, Ambrus Kaposi, Artjoms Sinkarovs, Tamás Végh |
Combinatory Logic and Lambda Calculus Are Equal, Algebraically. |
FSCD |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Davide Barbarossa, Paolo Pistone |
Tropical Mathematics and the Lambda-Calculus (short paper) (text not included). |
ICTCS |
2023 |
DBLP BibTeX RDF |
|
20 | Claudio Sacerdoti Coen, Riccardo Treglia |
Properties of a Computational Lambda Calculus for Higher-Order Relational Queries. |
ICTCS |
2023 |
DBLP BibTeX RDF |
|
20 | Rei Kasuya, Noriaki Yoshiura |
Obfuscating LLVM IR with the Application of Lambda Calculus. |
ACIIDS (2) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Oleksandr Deineha, Volodymyr Donets, Grygoriy Zholtkevych |
On Randomization of Reduction Strategies for Typeless Lambda Calculus. |
ICTERI |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Xinyi Wan, Qinxiang Cao |
Formalization of Lambda Calculus with Explicit Names as a Nominal Reasoning Framework. |
SETTA |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Andrea Ferenczová, Ján Perhác |
Interactive Web-Based Interpreter of the $\lambda$-Calculus. |
SISY |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Bhashithe Abeysinghe, Rajshekhar Sunderraman |
An Interactive Lambda Calculus Execution Engine. |
CompEd (2) |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Harjit Singh |
Propositions with Typed Lambda Calculus λ. |
SN Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Marcelo Fiore |
Semantic analysis of normalisation by evaluation for typed lambda calculus. |
Math. Struct. Comput. Sci. |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Dániel Horpácsi, Péter Bereczky, Simon J. Thompson |
Program Equivalence in an Untyped, Call-by-value Lambda Calculus with Uncurried Recursive Functions. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Marcelo Fiore |
Semantic Analysis of Normalisation by Evaluation for Typed Lambda Calculus. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Jason Z. S. Hu, Brigitte Pientka |
A Categorical Normalization Proof for the Modal Lambda-Calculus. |
MFPS |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Alejandro Díaz-Caro, Gilles Dowek |
Linear lambda-calculus is linear. |
CoRR |
2022 |
DBLP BibTeX RDF |
|
20 | Pablo Nogueira, Álvaro García-Pérez |
Equivalence of eval-readback and eval-apply big-step evaluators by regimentation of the lambda-calculus's strategy space. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | Michal Buran, David M. Cerna |
One or Nothing: Anti-unification over the Simply-Typed Lambda Calculus. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
20 | David Sabel, Manfred Schmidt-Schauß, Luca Maio |
A Probabilistic Call-by-Need Lambda-Calculus - Extended Version. |
CoRR |
2022 |
DBLP DOI BibTeX RDF |
|
Displaying result #301 - #400 of 1386 (100 per page; Change: ) Pages: [ <<][ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ 11][ 12][ 13][ >>] |
|