Results 1 to 10 of about 8,375 (166)
Linear Dependent Type Theory for Quantum Programming Languages [PDF]
Logical Methods in Computer Science, 2022 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 +3 more sources
Development and Application of a Software Tool to Support the Teaching of Formal Languages
Открытое образование (Москва), 2021 The purpose of the article is to present the results of a study on the possibility of using a deductive approach in the study of programming languages (from the theory of formal languages to specific programming languages) and the development of a ...
A. P. Sergushicheva, E. N. Davydova
doaj +1 more source
Implementation of hyperbolic complex numbers in Julia language
Discrete and Continuous Models and Applied Computational Science, 2022 Hyperbolic complex numbers are used in the description of hyperbolic spaces. One of the well-known examples of such spaces is the Minkowski space, which plays a leading role in the problems of the special theory of relativity and electrodynamics. However,
Anna V. Korolkova +2 more
doaj +1 more source
Aperiodicity, Star-freeness, and First-order Logic Definability of Operator Precedence Languages [PDF]
Logical Methods in Computer Science, 2023 A classic result in formal language theory is the equivalence among non-counting, or aperiodic, regular languages, and languages defined through star-free regular expressions, or first-order logic.
Dino Mandrioli +2 more
doaj +1 more source
Quantum Programming Made Easy [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 We present IQu, namely a quantum programming language that extends Reynold's Idealized Algol, the paradigmatic core of Algol-like languages. IQu combines imperative programming with high-order features, mediated by a simple type theory. IQu mildly merges
Luca Paolini +2 more
doaj +1 more source
Circular Proofs as Session-Typed Processes: A Local Validity Condition [PDF]
Logical Methods in Computer Science, 2022 Proof theory provides a foundation for studying and reasoning about programming languages, most directly based on the well-known Curry-Howard isomorphism between intuitionistic logic and the typed lambda-calculus.
Farzaneh Derakhshan, Frank Pfenning
doaj +1 more source
A Swiss Pocket Knife for Computability [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 This research is about operational- and complexity-oriented aspects of classical foundations of computability theory. The approach is to re-examine some classical theorems and constructions, but with new criteria for success that are natural from a ...
Neil D. Jones
doaj +1 more source
Composing games into complex institutions
PLoS ONE, 2023 Game theory is used by all behavioral sciences, but its development has long centered around the economic interpretation of equilibrium outcomes in relatively simple games and toy systems.
Seth Frey +3 more
doaj +2 more sources
Российский технологический журнал, 2022 Objectives. The paper deals with the equivalence of program schemes. According to A.A. Lyapunov and Yu.I. Yanov, the founders of this theory, a program scheme is understood as a program model wherein abstraction from contensive values of operators and ...
Y. P. Korablin
doaj +1 more source
Сучасні інформаційні системи, 2022 The object of research in the article are the tools and capabilities of the C# programming language for the implementation of cybersecurity analysis software in local computer networks and computer-integrated systems.
Vladyslav Pashynskykh +4 more
doaj +1 more source