Results 51 to 60 of about 226,250 (290)

Preservation of Strong Normalisation modulo permutations for the structural lambda-calculus [PDF]

Logical Methods in Computer Science, 2012
Inspired by a recent graphical formalism for lambda-calculus based on linear logic technology, we introduce an untyped structural lambda-calculus, called lambda j, which combines actions at a distance with exponential rules decomposing the substitution ...
Beniamino Accattoli, Delia Kesner
doaj   +1 more source

Efficient Substitution in Hoare Logic Expressions

Electronic Notes in Theoretical Computer Science, 2001
AbstractSubstitution plays an important role in Hoare Logic, as it is used in interpreting assignments. When writing a computer-based realization of Hoare Logic, it is therefore important to choose a good implementation for it. In this paper we compare different definitions and implementations of substitution in a logical framework, in an effort to ...
W. Appel, Andrew, N. Swadi, Kedar, Virga, Roberto   +2 more
openaire   +1 more source

Printed Integrated Logic Circuits Based on Chitosan‐Gated Organic Transistors for Future Edible Systems

Advanced Functional Materials, EarlyView.
Edible electronics needs integrated logic circuits for computation and control. This work presents a potentially edible printed chitosan‐gated transistor with a design optimized for integration in circuits. Its implementation in integrated logic gates and circuits operating at low voltage (0.7 V) is demonstrated, as well as the compatibility with an ...
Giulia Coco, Valerio Francesco Annese, Valerio Galli, Ilaria Penna, Debora Russo, Marina Veronesi, Rita Scarpelli, Stefania Sabella, Mario Caironi   +8 more
wiley   +1 more source

Explicit substitions and all that

Revista Colombiana de Computación, 2000
Explicit substitution calculi are extensions of the calculus where the substitution mechanism is internalized into the theory. This feature makes them suitable for implementation and theoretical study of logic based tools as strongly typed programming ...
Mauricio Ayala Rincón, César Muñoz
doaj  

Monadic Second-Order Logic with Arbitrary Monadic Predicates

, 2017
We study Monadic Second-Order Logic (MSO) over finite words, extended with (non-uniform arbitrary) monadic predicates. We show that it defines a class of languages that has algebraic, automata-theoretic and machine-independent characterizations.
Fijalkow, Nathanaël, Paperman, Charles
core   +3 more sources

Demonstration of an All‐Optical AND Gate Mediated by Photochromic Molecules

Advanced Functional Materials, EarlyView.
A logic AND gate that runs on photons is demonstrated. It relies on two spatially separated photochromic molecules that work in tandem. Abstract The realization of a photonic logic AND gate, i.e. a logic AND gate that runs on photons rather than electrons, and where all steps are controlled by light, is demonstrated. In a proof‐of‐principle experiment,
Heyou Zhang, Max Gießübel, Pankaj Dharpure, Andrea Albert, Vira Niestierkina, Paul Mulvaney, Mukundan Thelakkat, Jürgen Köhler   +7 more
wiley   +1 more source

Photoswitching Conduction in Framework Materials

Advanced Functional Materials, EarlyView.
This mini‐review summarizes recent advances in state‐of‐the‐art proton and electron conduction in framework materials that can be remotely and reversibly switched on and off by light. It discusses the various photoswitching conduction mechanisms and the strategies employed to enhance photoswitched conductivity.
Helmy Pacheco Hernandez, Stefan Hecht, Wolfgang Wenzel, Lars Heinke, Mariana Kozlowska   +4 more
wiley   +1 more source

Algebraic Logic Perspective on Prucnal’s Substitution [PDF]

Notre Dame Journal of Formal Logic, 2016
A term $\mathit{td}(p,q,r)$ is called a ternary deductive (TD) term for a variety of algebras $\mathcal{V}$ if the identity $\mathit{td}(p,p,r)\approxr$ holds in $\mathcal{V}$ and $(\mathsf{c},\mathsf{d})\in\theta(\mathsf{a},\mathsf{b})$ yields $\mathit{td}(\mathsf{a},\mathsf{b},\mathsf{c})\approx\mathit{td}(\mathsf{a},\mathsf{b},\mathsf{d})$ for any $\
openaire   +2 more sources

Integration of Low‐Voltage Nanoscale MoS2 Memristors on CMOS Microchips

Advanced Functional Materials, EarlyView.
This article presents the first monolithic integration of nanoscale MoS2‐based memristors into the back‐end‐of‐line of foundry‐fabricated CMOS microchips in a one‐transistor‐one‐resistor (1T1R) architecture. The MoS2‐based 1T1R cells exhibit forming‐free, nonvolatile resistive switching with ultra‐low operating voltages, low cycle‐to‐cycle variability ...
Jimin Lee, Sofía Cruces, Xiaohua Liu, Yang Chen, Vasilis A. Maroufidis, Janghyun Jo, Lukas Völkel, Dennis Braun, Michael Möller, Leon Brackmann, Holger Kalisch, Michael Heuken, Andrei Vescan, Rafal E. Dunin‐Borkowski, Joachim Mayer, Stefan Wiefels, Max C. Lemme   +16 more
wiley   +1 more source

A Practical Type Analysis for Verification of Modular Prolog Programs [PDF]

, 2008
Regular types are a powerful tool for computing very precise descriptive types for logic programs. However, in the context of real life, modular Prolog programs, the accurate results obtained by regular types often come at the price of efficiency.
Correas Fernandez, Jesús, Hermenegildo, Manuel V., Pietrzak, Pawel, Puebla Sánchez, Alvaro Germán   +3 more
core   +3 more sources