Theoretical Computer Science
Combinatory reduction systems: introduction and survey
Theoretical Computer Science - A collection of contributions in honour of Corrado Bo¨hm on the occasion of his 70th birthday
An equivalence between lambda-terms
Theoretical Computer Science
Terminiation of permutative conversions in intuitionistic Gentzen calculi
Theoretical Computer Science - Special issue: Gentzen
Reversible, irreversible and optimal &lgr;-machines
Theoretical Computer Science - Special issue on linear logic, 1
Call-by-name call-by-value, call-by-need and the linear lambda calculus
Theoretical Computer Science - Special issue on mathematical foundations of programming semantics
Pure Type Systems with Definitions
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Explicit Substitutions and Programming Languages
Proceedings of the 19th Conference on Foundations of Software Technology and Theoretical Computer Science
Proof nets and explicit substitutions
Mathematical Structures in Computer Science
A λ-calculus with explicit weakening and explicit substitution
Mathematical Structures in Computer Science
Resource operators for λ-calculus
Information and Computation
Local Bigraphs and Confluence: Two Conjectures
Electronic Notes in Theoretical Computer Science (ENTCS)
MFCS '09 Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science 2009
Jumping boxes: representing lambda-calculus boxes by jumps
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Matching modulo superdevelopments application to second-order matching
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A terminating and confluent linear lambda calculus
RTA'06 Proceedings of the 17th international conference on Term Rewriting and Applications
The theory of calculi with explicit substitutions revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Nested proof search as reduction in the Lambda-calculus
Proceedings of the 13th international ACM SIGPLAN symposium on Principles and practices of declarative programming
LPAR'12 Proceedings of the 18th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
Call-by-Value solvability, revisited
FLOPS'12 Proceedings of the 11th international conference on Functional and Logic Programming
An Infinitary Affine Lambda-Calculus Isomorphic to the Full Lambda-Calculus
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
A nonstandard standardization theorem
Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Inspired by a recent graphical formalism for λ-calculus based on Linear Logic technology, we introduce an untyped structural λ-calculus, called λj, which combines action at a distance with exponential rules decomposing the substitution by means of weakening, contraction and dereliction. Firstly, we prove fundamental properties such as confluence and preservation of β-strong normalisation. Secondly, we use λj to describe known notions of developments and superdevelopments, and introduce a more general one called XL-development. Then we show how to reformulate Regnier's s-equivalence in λj so that it becomes a strong bisimulation. Finally, we prove that explicit composition or de-composition of substitutions can be added to λj while still preserving β-strong normalisation.