scholarly journals Fully abstract models for effectful λ-calculi via category-theoretic logical relations

2022 ◽  
Vol 6 (POPL) ◽  
pp. 1-28
Author(s):  
Ohad Kammar ◽  
Shin-ya Katsumata ◽  
Philip Saville
Keyword(s):  
Abstract Model ◽  
Probabilistic Programming ◽  
Smooth Maps

We present a construction which, under suitable assumptions, takes a model of Moggi’s computational λ-calculus with sum types, effect operations and primitives, and yields a model that is adequate and fully abstract. The construction, which uses the theory of fibrations, categorical glueing, ⊤⊤-lifting, and ⊤⊤-closure, takes inspiration from O’Hearn & Riecke’s fully abstract model for PCF. Our construction can be applied in the category of sets and functions, as well as the category of diffeological spaces and smooth maps and the category of quasi-Borel spaces, which have been studied as semantics for differentiable and probabilistic programming.

A fully abstract model for sequential computation

2000 ◽  
Vol 35 ◽  
pp. 1-20 ◽  
Author(s):  
M MARZ
Keyword(s):  
Abstract Model ◽  
Sequential Computation

Representation Theorems for Terms in a Certain Model for Information Systems

1982 ◽  
Vol 5 (1) ◽  
pp. 1-14
Author(s):  
Bernd Reusch ◽  
Gerd Szwillus
Keyword(s):  
Information Systems ◽  
Normal Forms ◽  
Abstract Model ◽  
Representation Theorems

We study a term-language, which is used by the “Warsaw-School” in an abstract model for information systems. Various normal forms as well as standard expansions with respect to product terms are formulated and proved correct. It is shown that the shortest sums of so-called maximal sub-products are the shortest representations of terms and algorithms for their generation are given.

scholarly journals Invariants of Stable Maps between Closed Orientable Surfaces

Mathematics ◽  
2021 ◽  
Vol 9 (3) ◽  
pp. 215
Author(s):  
Catarina Mendes de Jesus S. ◽  
Pantaleón D. Romero
Keyword(s):  
Point Of View ◽  
Stable Maps ◽  
Smooth Maps ◽  
Orientable Surfaces

In this paper, we will consider the problem of constructing stable maps between two closed orientable surfaces M and N with a given branch set of curves immersed on N. We will study, from a global point of view, the behavior of its families in different isotopies classes on the space of smooth maps. The main goal is to obtain different relationships between invariants. We will provide a new proof of Quine’s Theorem.

scholarly journals Publisher Correction: Universal probabilistic programming offers a powerful approach to statistical phylogenetics

2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Fredrik Ronquist ◽  
Jan Kudlicka ◽  
Viktor Senderov ◽  
Johannes Borgström ◽  
Nicolas Lartillot ◽  
...  
Keyword(s):  
Probabilistic Programming ◽  
Powerful Approach

A Correction to this paper has been published: https://doi.org/10.1038/s42003-021-01922-8

scholarly journals Fabular: regression formulas as probabilistic programming

2016 ◽  
Vol 51 (1) ◽  
pp. 271-283
Author(s):  
Johannes Borgström ◽  
Andrew D. Gordon ◽  
Long Ouyang ◽  
Claudio Russo ◽  
Adam Ścibior ◽  
...  
Keyword(s):  
Probabilistic Programming

scholarly journals Short notes: On using an Abstract Model of Distributed Database Concurrency Control Methods

1988 ◽  
Vol 31 (6) ◽  
pp. 570-572
Author(s):  
M. H. Rennhackkamp
Keyword(s):  
Concurrency Control ◽  
Distributed Database ◽  
Control Methods ◽  
Abstract Model

scholarly journals Analysis and Enhancement of IEEE 802.15.4e DSME Beacon Scheduling Model

2014 ◽  
Vol 2014 ◽  
pp. 1-15 ◽  
Author(s):  
Kwang-il Hwang ◽  
Sung-wook Nam
Keyword(s):  
Internet Of Things ◽  
Large Scale ◽  
Ieee 802.15.4 ◽  
Design Model ◽  
Abstract Model ◽  
Modes Of Operation ◽  
Network Construction ◽  
Scheduling Model ◽  
And Performance ◽  
Ieee 802.15.4E

In order to construct a successful Internet of things (IoT), reliable network construction and maintenance in a sensor domain should be supported. However, IEEE 802.15.4, which is the most representative wireless standard for IoT, still has problems in constructing a large-scale sensor network, such as beacon collision. To overcome some problems in IEEE 802.15.4, the 15.4e task group proposed various different modes of operation. Particularly, the IEEE 802.15.4e deterministic and synchronous multichannel extension (DSME) mode presents a novel scheduling model to solve beacon collision problems. However, the DSME model specified in the 15.4e draft does not present a concrete design model but a conceptual abstract model. Therefore, in this paper we introduce a DSME beacon scheduling model and present a concrete design model. Furthermore, validity and performance of DSME are evaluated through experiments. Based on experiment results, we analyze the problems and limitations of DSME, present solutions step by step, and finally propose an enhanced DSME beacon scheduling model. Through additional experiments, we prove the performance superiority of enhanced DSME.

Sign in / Sign up

Export Citation Format

Share Document