Zobrazeno 1 - 10
of 56
pro vyhledávání: '"McKinna, James"'
Autor:
Tang, Wenhao, Hillerström, Daniel, McKinna, James, Steuwer, Michel, Dardha, Ornela, Fu, Rongxiao, Lindley, Sam
Structural subtyping and parametric polymorphism provide similar flexibility and reusability to programmers. For example, both features enable the programmer to provide a wider record as an argument to a function that expects a narrower one. However,
Externí odkaz:
http://arxiv.org/abs/2304.08267
Automatic differentiation (AD) has been a topic of interest for researchers in many disciplines, with increased popularity since its application to machine learning and neural networks. Although many researchers appreciate and know how to apply AD, i
Externí odkaz:
http://arxiv.org/abs/2212.11088
Almost every programming language's syntax includes a notion of binder and corresponding bound occurrences, along with the accompanying notions of $\alpha$-equivalence, capture-avoiding substitution, typing contexts, runtime environments, and so on.
Externí odkaz:
http://arxiv.org/abs/2001.11001
Publikováno v:
In Science of Computer Programming August 2023
Bidirectional transformations (bx) have primarily been modeled as pure functions, and do not account for the possibility of the side-effects that are available in most programming languages. Recently several formulations of bx that use monads to acco
Externí odkaz:
http://arxiv.org/abs/1601.02484
Bidirectional transformations (bx) support principled consistency maintenance between data sources. Each data source corresponds to one perspective on a composite system, manifested by operations to 'get' and 'set' a view of the whole from that parti
Externí odkaz:
http://arxiv.org/abs/1505.02579
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Calculi with control operators have been studied as extensions of simple type theory. Real programming languages contain datatypes, so to really understand control operators, one should also include these in the calculus. As a first step in that dire
Externí odkaz:
http://arxiv.org/abs/1204.0347
Publikováno v:
Logical Methods in Computer Science, Volume 7, Issue 1 (March 23, 2011) lmcs:842
Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defi
Externí odkaz:
http://arxiv.org/abs/1012.3372
Publikováno v:
EPTCS 34, 2010, pp. 53-67
We present an approach to type theory in which the typing judgments do not have explicit contexts. Instead of judgments of shape "Gamma |- A : B", our systems just have judgments of shape "A : B". A key feature is that we distinguish free and bound v
Externí odkaz:
http://arxiv.org/abs/1009.2792