Results 31 to 40 of about 6,236,903 (286)
Guarded Cubical Type Theory [PDF]
Journal of Automated Reasoning, 2018 This paper improves the treatment of equality in guarded dependent type theory (GDTT), by combining it with cubical type theory (CTT). GDTT is an extensional type theory with guarded recursive types, which are useful for building models of program logics, and for programming and reasoning with coinductive types. We wish to implement GDTT with decidable
Lars Birkedal +5 more
openaire +4 more sources
Web-Based Questionnaires for Type Theory Course [PDF]
Acta Electrotechnica et Informatica, 2017 This paper describes our effort on the usage of modern information and communication technologies as well as innovation process in the field of teaching.
Daniel MIHÁLYI +3 more
doaj +1 more source
Towards a directed homotopy type theory [PDF]
, 2018 In this paper, we present a directed homotopy type theory for reasoning synthetically about (higher) categories, directed homotopy theory, and its applications to concurrency. We specify a new `homomorphism' type former for Martin-L\"of type theory which
Brown +13 more
core +2 more sources
Natural Neighborhood-Based Classification Algorithm Without Parameter k
Big Data Mining and Analytics, 2018 Various kinds of k-Nearest Neighbor (KNN) based classification methods are the bases of many well-established and high-performance pattern recognition techniques. However, such methods are vulnerable to parameter choice.
Ji Feng, Yan Wei, Qingsheng Zhu
doaj +1 more source
Weak omega-categories from intensional type theory [PDF]
Logical Methods in Computer Science, 2010 We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster.
Peter LeFanu Lumsdaine
doaj +1 more source
Extending Nunchaku to Dependent Type Theory [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Nunchaku is a new higher-order counterexample generator based on a sequence of transformations from polymorphic higher-order logic to first-order logic. Unlike its predecessor Nitpick for Isabelle, it is designed as a stand-alone tool, with frontends for
Simon Cruanes +1 more
doaj +1 more source
A Formal Verification Approach for Linux Kernel Designing
TechnologiesAlthough the Linux kernel is widely used, its complexity makes errors common and potentially serious. Traditional formal verification methods often have high overhead and rely heavily on manual coding.
Zi Wang +3 more
doaj +1 more source
New Vacua for Type II String Theory [PDF]
, 1995 Lorentz-invariant expectation values for antisymmetric tensor field strengths in Calabi-Yau compactification of IIA string theory are considered. These are found to impart magnetic and/or electric charges to the dilaton hypermultiplet.
Andrew Strominger +17 more
core +2 more sources
NS fivebranes in type 0 string theory [PDF]
, 1999 The massless degrees of freedom of type 0 NS5-branes are derived. A non-chiral, purely bosonic spectrum is found in both type 0A and 0B. This non-chirality is confirmed by a one-loop computation in the bulk.
Craps, Ben, Roose, Frederik
core +3 more sources
Occurrence typing modulo theories [PDF]
Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2016 We present a new type system combining occurrence typing---a technique previously used to type check programs in dynamically-typed languages such as Racket, Clojure, and JavaScript---with dependent refinement types. We demonstrate that the addition of refinement types allows the integration of arbitrary solver-backed reasoning about logical ...
Kent, Andrew M. +2 more
openaire +2 more sources