Results 41 to 50 of about 1,184,149 (273)
Undecidability of Equality in the Free Locally Cartesian Closed Category (Extended version) [PDF]
Logical Methods in Computer Science, 2017 We show that a version of Martin-L\"of type theory with an extensional identity type former I, a unit type N1 , Sigma-types, Pi-types, and a base type is a free category with families (supporting these type formers) both in a 1- and a 2-categorical sense.
Simon Castellan +2 more
doaj +1 more source
Ordering and order-disorder phase transition in the (1x1) monolayer chemisorbed on the (111) face of an fcc crystal [PDF]
, 2016 In this paper we have considered a simple lattice gas model of chemisorbed monolayer which allows for the harmonic fluctuations of the bond length between the adsorbate atom and the surface site.
Patrykiejew, A., Staszewski, T.
core +3 more sources
QRB-Domains and the Probabilistic Powerdomain [PDF]
Logical Methods in Computer Science, 2012 Is there any Cartesian-closed category of continuous domains that would be closed under Jones and Plotkin's probabilistic powerdomain construction? This is a major open problem in the area of denotational semantics of probabilistic higher-order languages.
Jean Goubault-Larrecq
doaj +1 more source
Test, Teachers, Quorum (Pure Populations)
Serdica Journal of Computing, 2014 The “trial and error” method is fundamental for Master Minddecision algorithms. On the basis of Master Mind games and strategies weconsider some data mining methods for tests using students as teachers.Voting, twins, opposite, simulate and observer ...
S. Radev
semanticscholar +1 more source
Nested Hoare Triples and Frame Rules for Higher-order Store [PDF]
Logical Methods in Computer Science, 2011 Separation logic is a Hoare-style logic for reasoning about programs with heap-allocated mutable data structures. As a step toward extending separation logic to high-level languages with ML-style general (higher-order) storage, we investigate the ...
Jan Schwinghammer +3 more
doaj +1 more source
Local Reasoning about Probabilistic Behaviour for Classical-Quantum Programs [PDF]
arXiv, 2023 Verifying the functional correctness of programs with both classical and quantum constructs is a challenging task. The presence of probabilistic behaviour entailed by quantum measurements and unbounded while loops complicate the verification task greatly.
arxiv
Uniform asymptotic estimates of hypergeometric functions appearing in Potential Theory [PDF]
, 1996 19 pages, no figures.-- MSC1991 codes: 33C05, 33C55, 31B15.MR#: MR1393128 (98b:33007)Zbl#: Zbl 0864.33001The solution of a Dirichlet problem for the Laplace-Beltrami operator with Bergman metric in the unit ball in the complex $n$-dimensional space can ...
Pestana, Domingo, Rodríguez, José M.
core +3 more sources
Stone-Type Dualities for Separation Logics [PDF]
Logical Methods in Computer Science, 2019 Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen soundness and completeness to a categorical equivalence, yielding a ...
Simon Docherty, David Pym
doaj +1 more source
Pushdown Normal-Form Bisimulation: A Nominal Context-Free Approach to Program Equivalence [PDF]
arXiv, 2023 We propose Pushdown Normal Form (PDNF) Bisimulation to verify contextual equivalence in higher-order functional programming languages with local state. Similar to previous work on Normal Form (NF) bisimulation, PDNF Bisimulation is sound and complete with respect to contextual equivalence.
arxiv
Dualized Simple Type Theory [PDF]
Logical Methods in Computer Science, 2017 We propose a new bi-intuitionistic type theory called Dualized Type Theory (DTT). It is a simple type theory with perfect intuitionistic duality, and corresponds to a single-sided polarized sequent calculus.
Harley Eades III +2 more
doaj +1 more source