Results 71 to 80 of about 228,061 (236)
A New Proof of P-time Completeness of Linear Lambda Calculus [PDF]
, 2013 We give a new proof of P-time completeness of Linear Lambda Calculus, which was originally given by H. Mairson in 2003. Our proof uses an essentially different Boolean type from the type Mairson used. Moreover the correctness of our proof can be machined-
Matsuoka, Satoshi
core
, 2007 Cirquent calculus is a new proof-theoretic and semantic framework, whose main distinguishing feature is being based on circuits, as opposed to the more traditional approaches that deal with tree-like objects such as formulas or sequents.
Japaridze, Giorgi
core +4 more sources
Advanced Engineering Materials, EarlyView.This article presents a solver‐agnostic domain‐specific language (DSL) for computational structural mechanics that strengthens interoperability in virtual product development. Using a hierarchical data model, the DSL enables seamless exchange between diverse simulation tools and numerical methods.
Martin Rädel +3 more
wiley +1 more source
Limitations of Algebraic Approaches to Graph Isomorphism Testing
, 2015 We investigate the power of graph isomorphism algorithms based on algebraic reasoning techniques like Gr\"obner basis computation. The idea of these algorithms is to encode two graphs into a system of equations that are satisfiable if and only if if the ...
A Atserias +10 more
core +1 more source
Achieving Large and Anisotropic Spin‐Mediated Thermal Transport in Textured Quantum Magnets
Advanced Functional Materials, Volume 35, Issue 12, March 18, 2025.An advanced solvent‐cast cold pressing method is developed to synthesize highly textured quantum magnets. By aligning spin chains in Ca2CuO3 perpendicular to the pressing direction, a spin‐mediated thermal conductivity of 10 ± 1 W m⁻¹ K⁻¹ is achieved, the highest reported for polycrystalline quantum materials.
Shucheng Guo +6 more
wiley +1 more source
The Arity Hierarchy in the Polyadic μ-Calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 The polyadic mu-calculus is a modal fixpoint logic whose formulas define relations of nodes rather than just sets in labelled transition systems. It can express exactly the polynomial-time computable and bisimulation-invariant queries on finite graphs ...
Martin Lange
doaj +1 more source
On equivalences and standardization in a non-deterministic call-by-need lambda calculus [PDF]
, 2007 The goal of this report is to prove correctness of a considerable subset of transformations w.r.t. contextual equivalence in a an extended lambda-calculus with case, constructors, seq, let, and choice, with a simple set of reduction rules. Unfortunately,
Mann, Matthias, Schmidt-Schauß, Manfred
core +1 more source
Models and termination of proof reduction in the $\lambda$$\Pi$-calculus modulo theory
, 2017 We define a notion of model for the $\lambda$$\Pi$-calculus modulo theory and prove a soundness theorem. We then define a notion of super-consistency and prove that proof reduction terminates in the $\lambda$$\Pi$-calculus modulo any super-consistent ...
Dowek, Gilles
core +1 more source
3D Printed Ultra‐Fast Plastic Scintillators Based on Perovskite‐Photocurable Polymer Composite
Advanced Functional Materials, Volume 35, Issue 12, March 18, 2025.The demand for radiation detection is increasing in a number of fields, including high‐energy physics, medical imaging, and homeland security. This study serves to demonstrate the potential for the fabrication of fast perovskite‐based scintillators with complex shapes via stereolithographic additive manufacturing, representing a new path toward the ...
Antonella Giuri +16 more
wiley +1 more source
A termination proof of reduction in a simply typed calculus with constructors [PDF]
, 2011 The well-known proof of termination of reduction in simply typed calculi is adapted to a monomorphically typed lambda-calculus with case and constructors and recursive data types. The proof differs at several places from the standard proof. Perhaps it is
Sabel, David, Schmidt-Schauß, Manfred
core