Results 41 to 50 of about 230,472 (297)
(Leftmost-Outermost) Beta Reduction is Invariant, Indeed [PDF]
Logical Methods in Computer Science, 2016 Slot and van Emde Boas' weak invariance thesis states that reasonable machines can simulate each other within a polynomially overhead in time. Is lambda-calculus a reasonable machine?
Beniamino Accattoli, Ugo Dal Lago
doaj +1 more source
Strong normalization of lambda-Sym-Prop- and lambda-bar-mu-mu-tilde-star- calculi [PDF]
Logical Methods in Computer Science, 2017 In this paper we give an arithmetical proof of the strong normalization of lambda-Sym-Prop of Berardi and Barbanera [1], which can be considered as a formulae-as-types translation of classical propositional logic in natural deduction style.
Peter Battyanyi, Karim Nour
doaj +1 more source
Hereditary Substitution for the λΔ-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 Hereditary substitution is a form of type-bounded iterated substitution, first made explicit by Watkins et al. and Adams in order to show normalization of proof terms for various constructive logics.
Harley Eades, Aaron Stump
doaj +1 more source
The Lambda Calculus is Quantifiable
CoRRIn this paper we introduce several quantitative methods for the lambda-calculus based on partial metrics, a well-studied variant of standard metric spaces that have been used to metrize non-Hausdorff topologies, like those arising from Scott domains. First, we study quantitative variants, based on program distances, of sensible equational theories for ...
Maestracci, Valentin, Pistone, Paolo
openaire +5 more sources
Minimal lambda-theories by ultraproducts [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 A longstanding open problem in lambda calculus is whether there exist continuous models of the untyped lambda calculus whose theory is exactly the least lambda-theory lambda-beta or the least sensible lambda-theory H (generated by equating all the ...
Antonio Bucciarelli +2 more
doaj +1 more source
Mathematical Structures in Computer Science, 2015 One of the best-known methods for discriminating λ-terms with respect to β-convertibility is due to Corrado Böhm. The idea is to compute the infinitary normal form of a λ-term M, the Böhm Tree (BT) of M. If λ-terms M, N have distinct BTs, then M ≠βN, that is, M and N are not β-convertible. But what if their BTs coincide?
Jörg Endrullis +3 more
openaire +4 more sources
Extending the Extensional Lambda Calculus with Surjective Pairing is Conservative [PDF]
Logical Methods in Computer Science, 2006 We answer Klop and de Vrijer's question whether adding surjective-pairing axioms to the extensional lambda calculus yields a conservative extension. The answer is positive. As a byproduct we obtain a "syntactic" proof that the extensional lambda calculus
Kristian Stoevring
doaj +1 more source
Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis
FEBS Letters, EarlyView.Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee +7 more
wiley +1 more source
The algebraic lambda calculus [PDF]
Mathematical Structures in Computer Science, 2009 We introduce an extension of the pure lambda calculus by endowing the set of terms with the structure of a vector space, or, more generally, of a module, over a fixed set of scalars. Moreover, terms are subject to identities similar to the usual pointwise definition of linear combinations of functions with values in a vector space.
openaire +2 more sources
An estimation for the lengths of reduction sequences of the $\lambda\mu\rho\theta$-calculus [PDF]
Logical Methods in Computer Science, 2018 Since it was realized that the Curry-Howard isomorphism can be extended to the case of classical logic as well, several calculi have appeared as candidates for the encodings of proofs in classical logic.
Péter Battyányi, Karim Nour
doaj +1 more source