Semantic analysis of normalisation by evaluation for typed lambda calculus
Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming
Compositional Characterizations of lambda-Terms Using Intersection Types
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
Confluence of Untyped Lambda Calculus via Simple Types
ICTCS '01 Proceedings of the 7th Italian Conference on Theoretical Computer Science
Characterising Strong Normalisation for Explicit Substitutions
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
TYPES '98 Selected papers from the International Workshop on Types for Proofs and Programs
On the Computational Interpretation of Negation
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
Actual Arithmetic and Feasibility
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Computational isomorphisms in classical logic
Theoretical Computer Science - Linear logic
Higher-order unification and matching
Handbook of automated reasoning
A formalised first-order confluence proof for the λ-calculus using one-sorted variable names
Information and Computation - RTA 2001
A binary modal logic for the intersection types of lambda-calculus
Information and Computation
The differential Lambda-calculus
Theoretical Computer Science
Reductions, intersection types, and explicit substitutions
Mathematical Structures in Computer Science
Encoding left reduction in the λ-calculus with interaction nets
Mathematical Structures in Computer Science
Locus Solum: From the rules of logic to the logic of rules
Mathematical Structures in Computer Science
Decidability of fourth-order matching
Mathematical Structures in Computer Science
A general method for proving the normalization theorem for first and second order typed λ-calculi
Mathematical Structures in Computer Science
A semantics for lambda calculi with resources
Mathematical Structures in Computer Science
The lambda calculus is algebraic
Journal of Functional Programming
Intersection types for explicit substitutions
Information and Computation
Building continuous webbed models for system F
Theoretical Computer Science - Mathematical foundations of programming semantics
Behavioural inverse limit λ-models
Theoretical Computer Science - Logic, semantics and theory of programming
Tree operations in P systems and λ-calculus
Fundamenta Informaticae
An intuitionistic λ-calculus with exceptions
Journal of Functional Programming
Getting results from programs extracted from classical proofs
Theoretical Computer Science
Graph models of $\lambda$-calculus at work, and variations
Mathematical Structures in Computer Science
Compositional characterisations of λ-terms using intersection types
Theoretical Computer Science - Mathematical foundations of computer science 2000
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Nonmodularity Results for Lambda Calculus
Fundamenta Informaticae
A Behavioural Model for Klop's Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
Intersection-types à la Church
Information and Computation
A call-by-name lambda-calculus machine
Higher-Order and Symbolic Computation
Higher-Order and Symbolic Computation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On strong normalization and type inference in the intersection type discipline
Theoretical Computer Science
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Union of Reducibility Candidates for Orthogonal Constructor Rewriting
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
A Relational Model of a Parallel and Non-deterministic λ -Calculus
LFCS '09 Proceedings of the 2009 International Symposium on Logical Foundations of Computer Science
On the Values of Reducibility Candidates
TLCA '09 Proceedings of the 9th International Conference on Typed Lambda Calculi and Applications
Simplified Reducibility Proofs of Church-Rosser for β- and βη-reduction
Electronic Notes in Theoretical Computer Science (ENTCS)
Some Remarks on Type Systems for Course-of-value Recursion
Electronic Notes in Theoretical Computer Science (ENTCS)
Effective λ-models versus recursively enumerable λ-theories
Mathematical Structures in Computer Science
Mathematical Structures in Computer Science
Strong normalization property for second order linear logic
Theoretical Computer Science
Type Assignement for Mobile Objects
Electronic Notes in Theoretical Computer Science (ENTCS)
On Type Inference in the Intersection Type Discipline
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards an Intersection Typed System à la Church
Electronic Notes in Theoretical Computer Science (ENTCS)
Intersection Types for Light Affine Lambda Calculus
Electronic Notes in Theoretical Computer Science (ENTCS)
Realizability for Monotone and Clausular (Co)inductive Definitions
Electronic Notes in Theoretical Computer Science (ENTCS)
On strong normalization in the intersection type discipline
TLCA'03 Proceedings of the 6th international conference on Typed lambda calculi and applications
TYPES'02 Proceedings of the 2002 international conference on Types for proofs and programs
On linear combinations of λ-terms
RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Characterising strongly normalising intuitionistic sequent terms
TYPES'07 Proceedings of the 2007 international conference on Types for proofs and programs
Typing streams in the Λμ-calculus
ACM Transactions on Computational Logic (TOCL)
Focalisation and classical realisability
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Exponentials with infinite multiplicities
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Linearity, Non-determinism and Solvability
Fundamenta Informaticae - From Mathematical Beauty to the Truth of Nature: to Jerzy Tiuryn on his 60th Birthday
Specifying imperative ML-like programs using dynamic logic
FoVeOOS'10 Proceedings of the 2010 international conference on Formal verification of object-oriented software
Realizability and parametricity in pure type systems
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Controlling program extraction in light logics
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
A filter model for the λµ-calculus
TLCA'11 Proceedings of the 10th international conference on Typed lambda calculi and applications
An operational characterization of strong normalization
FOSSACS'06 Proceedings of the 9th European joint conference on Foundations of Software Science and Computation Structures
Strong normalization of MLF via a calculus of coercions
Theoretical Computer Science
λP systems and typed λ-calculus
WMC'04 Proceedings of the 5th international conference on Membrane Computing
The Scott model of linear logic is the extensional collapse of its relational model
Theoretical Computer Science
Standardization and böhm trees for Λµ-calculus
FLOPS'10 Proceedings of the 10th international conference on Functional and Logic Programming
A hierarchy for delimited continuations in call-by-name
FOSSACS'10 Proceedings of the 13th international conference on Foundations of Software Science and Computational Structures
Böhm theorem and Böhm trees for the Λμ-calculus
Theoretical Computer Science
Subject reduction vs intersection / union types in λµµ
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
A Term Assignment for Polarized Bi-intuitionistic Logic and its Strong Normalization
Fundamenta Informaticae - Logic for Pragmatics
Tree Operations in P Systems and λ-Calculus
Fundamenta Informaticae
Fundamenta Informaticae - Typed Lambda Calculi and Applications (TLCA'99)
Nonmodularity Results for Lambda Calculus
Fundamenta Informaticae
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus
Fundamenta Informaticae
Lambda Abstraction Algebras: Coordinatizing Models of Lambda Calculus
Fundamenta Informaticae
Categorical Combinators With Explicit Products
Fundamenta Informaticae
Fair cooperative multithreading: typing termination in a higher-order concurrent imperative language
CONCUR'07 Proceedings of the 18th international conference on Concurrency Theory
Classical program extraction in the calculus of constructions
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Completeness and Soundness Results for X with Intersection and Union Types
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Characterising Strongly Normalising Intuitionistic Terms
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Reducibility Proofs in the λ-Calculus
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
On Realisability Semantics for Intersection Types with Expansion Variables
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
Intersection Types and Termination Properties
Fundamenta Informaticae - Intersection Types and Related Systems ITRS
| Hi-index | 0.02 |