Results 31 to 40 of about 13,143,476 (301)
Visualizing Type-Checking Proofs: An Educational Web-Based System for an Extended Simply Typed Lambda Calculus [PDF]
Understanding simply typed lambda calculus is essential for learning type systems and formal semantics, but its abstract concepts are often challenging.
Ján Perháč, Vladyslav Futrak
doaj +1 more source
Resolution and Type Theory [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Gradually typed languages are designed to support both dynamically typed and statically typed programming styles while preserving the benefits of each. While existing gradual type soundness theorems for these languages aim to show that type-based reasoning is preserved when moving from the fully static setting to a gradual one, these theorems do not ...
Max S. New +2 more
openaire +5 more sources
Canonicity and homotopy canonicity for cubical type theory [PDF]
Cubical type theory provides a constructive justification of homotopy type theory. A crucial ingredient of cubical type theory is a path lifting operation which is explained computationally by induction on the type involving several non-canonical choices.
Thierry Coquand +2 more
doaj +1 more source
Natural Neighborhood-Based Classification Algorithm Without Parameter k
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
Linear Dependent Type Theory for Quantum Programming Languages [PDF]
Modern quantum programming languages integrate quantum resources and classical control. They must, on the one hand, be linearly typed to reflect the no-cloning property of quantum resources.
Peng Fu, Kohei Kishida, Peter Selinger
doaj +1 more source
The Effective action of type II Calabi-Yau orientifolds [PDF]
This article first reviews the calculation of the N = 1 effective action for generic type IIA and type IIB Calabi-Yau orientifolds in the presence of background fluxes by using a Kaluza-Klein reduction.
Grimm, Thomas W. +3 more
core +1 more source
Extending Nunchaku to Dependent Type Theory [PDF]
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
Multisets in type theory [PDF]
AbstractA multiset consists of elements, but the notion of a multiset is distinguished from that of a set by carrying information of how many times each element occurs in a given multiset. In this work we will investigate the notion of iterative multisets, where multisets are iteratively built up from other multisets, in the context Martin–Löf Type ...
openaire +2 more sources
A canonical normal form theorem for the type theory of regular categories [PDF]
openIn this thesis is shown a proof of canonical normal form theorem for the type theory of regular categories. The theorem states that any closed typed term, whose derivation has no open assumption, can be reduced by a sequence of reductions into an ...
BORSETTO, RICCARDO
core

