Results 21 to 30 of about 2,196,068 (340)
A two-level logic perspective on (simultaneous) substitutions [PDF]
Proceedings of the 7th ACM SIGPLAN International Conference on Certified Programs and Proofs - CPP 2018, 2018 Lambda-tree syntax (λts), also known as higher-order abstract syntax (hoas), is a representational technique where the pure λ-calculus in a meta language is used to represent binding constructs in an object language. A key feature of λts is that capture-avoiding substitution in the object language is represented by β-reduction in the meta language ...
Kaustuv Chaudhuri
openaire +5 more sources
On the Closure of Description Logics under Substitutions
, 2016 We investigate the extension of Description Logics (DL) with a notion of "substitution". Substitutions naturally arise when reasoning about programs which modify graph structures that are characterized by DLs. They constitute also a means to express concept and role modifications such as addition or deletion of individuals (respectively, pairs of ...
Brenas, Jon Haël +2 more
openaire +3 more sources
Explicit substitutions, logic and normalization
, 2004 Les substitutions explicites ont été introduites comme un raffinement du lambda-calcul, celui-ci étant leformalisme utilisé pour étudier la sémantique des langages de programmation. L'objet de cette thèseest l'étude de leurs propriétés de normalisation forte et de préservation de la normalisation forte.
Emmanuel Polonovski
openaire +3 more sources
Epsilon substitution for first- and second-order predicate logic
Annals of Pure and Applied Logic, 2013 G. Mints
semanticscholar +2 more sources
A substitution free axiom set for second order logic [PDF]
Notre Dame J. Formal Log., 1969 N. Cocchiarella
semanticscholar +2 more sources
Logic Programming, Substitutions and Finite Computability
DAIMI Report Series, 1985 <p>Apt and van Emden have studied the semantics of logic programming by means of fixed point methods. From a model theoretic point of view, their formalisation is very nice. Least and greatest fixed points correspond to least and greatest Herbrand-models respectively.</p><p>Viewed operationally, there is an ugly asymmetry.
Gudmund Skovbjerg Frandsen
openaire +4 more sources
Linguistic Data Model for Natural Languages and Artificial Intelligence. Part 7. Internal Logic 1
Дискурс, 2022 Introduction. The article continues a series of publications on the linguistics of relations (hereinafter referred to as R-linguistics) and is devoted to the study of the functioning of logical connectives with verbs. The article is the first part of the
O. M. Polyakov
doaj +1 more source
Conditional nature of the application of the substitution of the unserved part of punishment with a milder penalty as a way to improve this criminal law institution [PDF]
Пенитенциарная наука, 2023 Introduction: the article discusses the way to improve the application of norms of the institution of the substitution of the unserved part of punishment with a milder penalty (hereinafter – punishment substitution) by establishing conditions under ...
Balasanov M.R.
doaj +1 more source
Controllable p‐Type Doping of 2D WSe2 via Vanadium Substitution [PDF]
Advanced Functional Materials, 2021 Scalable substitutional doping of 2D transition metal dichalcogenides is a prerequisite to developing next‐generation logic and memory devices based on 2D materials. To date, doping efforts are still nascent. Here, scalable growth and vanadium (V) doping
Azimkhan Kozhakhmetov +12 more
semanticscholar +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