Buscar
Mostrando ítems 21-30 de 60
A machine-checked proof of the Standardization Theorem in Lambda Calculus using multiple substitution
(Universidad ORT Uruguay, 2018)
En el siguiente trabajo se presenta la formalización en Agda del Teorema de Estandarización para el Cálculo Lambda. Se presenta un corolario del Teorema de Estandarización junto con la demostración del teorema de reducción ...
The First-Order Hypothetical Logic of Proofs
(Oxford University Press, 2017-09)
The Propositional Logic of Proofs (LP) is a modal logic in which the modality □A is revisited as [[t]]A , t being an expression that bears witness to the validity of A . It enjoys arithmetical soundness and ...
Proof Normalisation in a Logic Identifying Isomorphic Propositions
(Schloss Dagstuhl. Leibniz-Zentrum für Informatik, 2019-06)
We define a fragment of propositional logic where isomorphic propositions, such as A ∧ B and B ∧ A, or A ⇒ (B ∧ C) and (A ⇒ B) ∧ (A ⇒ C) are identified. We define System I, a proof language for this logic, and prove its ...
Large Conformal metrics with prescribed sign-changing Gauss curvature
(Springer, 2015)
Let (M, g) be a two dimensional compact Riemannian manifold of genus g(M) > . Let f be a smooth function on M such that
f >= 0, f not equivalent to 0, min(M) f = 0.
Let be any set of points at which f (P-i) = 0 and ...
Distilling abstract machines
(Association for Computing Machinery, 2014-09)
It is well-known that many environment-based abstract machines can be seen as strategies in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear logic led to the linear substitution ...