Write in a clean editor, then format for Mathematical Structures in Computer Science in one click — DocuGuru applies the official Cambridge University Press template with numbered references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Mathematical Structures in Computer Science is a peer-reviewed journal published by Cambridge University Press, covering Logic, programming, and type systems, Logic, Reasoning, and Knowledge, Formal Methods in Verification.
| Publisher | Cambridge University Press |
|---|---|
| Reference style | Numbered Numbered — [1], [2] in the text [1] A. Smith, B. Jones, and C. Lee, A representative article title, Mathematical Structures in Computer Science 12 (2023) 45–58.
Formats any DOI in the closest standard style — Mathematical Structures in Computer Science has no published style definition, so this is an approximation. No sign-up. |
| Publishes research in | Logic, programming, and type systems Logic, Reasoning, and Knowledge Formal Methods in Verification Advanced Algebra and Logic Computability, Logic, AI Algorithms |
| ISSN | 0960-1295 |
| Citation impact (2-yr) | 0.68 |
| h-index | 69 |
| i10-index | 525 |
| Total citations | 26,584 |
| Top institutions publishing here | Centre National de la Recherche Scientifique |
| Journal website | journals.cambridge.org |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
This special issue of Mathematical Structures in Computer Science contains several contributions related to the modern field of Quantum Information and Quantum Computing. The first two papers deal with entanglement. The paper by R. Mosseri and P. Ribeiro presents a detailed description of the two- and three-qubit geometry in Hilbert space, dealing with the geometry…
In this paper, we present Reo, which forms a paradigm for composition of software components based on the notion of mobile channels. Reo is a channel-based exogenous coordination model in which complex coordinators, called connectors , are compositionally built out of simpler ones. The simplest connectors in Reo are a set of channels with well-defined…
This paper exhibits accurate encodings of the λ-calculus in the π-calculus. The former is canonical for calculation with functions, while the latter is a recent step (Milner et al. 1989) towards a canonical treatment of concurrent processes. With quite simple encodings, two λ-calculus reduction strategies are simulated very closely; each reduction in λ-calculus is mimicked…
We propose the design of a programming language for quantum computing. Traditionally, quantum algorithms are frequently expressed at the hardware level, for instance in terms of the quantum circuit model or quantum Turing machines. These approaches do not encourage structured programming or abstractions such as data types. In this paper, we describe the syntax and…
This paper investigates the transformation of λ ν -terms into continuation-passing style (CPS). We show that by appropriate η-expansion of Fisher and Plotkin's two-pass equational specification of the CPS transform, we can obtain a static and context-free separation of the result terms into “essential” and “administrative” constructs. Interpreting the former as syntax builders and the…
