We make a formal analogy between random sampling and fresh name generation. show that quasi-Borel spaces, model for probabilistic programming, can soundly interpret the ν-calculus, calculus Moreover, we prove this semantics is fully abstract up to first-order types. This surprising an ‘off-the-shelf’ model, requires novel analysis of probability distributions on function spaces. Our tools are d...

Measuring performance is key to reengineering and optimization of business processes. Although many of them cannot easily be measured due to their quantitative or non-deterministic nature, most performance measurement systems rely on the usage of numeric parameters (Key Performance Indicators, KPIs). So, performance problems stay invisible that could be assessed by other indirect indicators lik...

This paper reports on the annotation and maximum-entropy modeling of the semantics of two German prepositions, mit (‘with’) and auf (‘on’). 500 occurrences of each preposition were sampled from a treebank and annotated with syntactosemantic classes by two annotators. The classification is guided by a perspective of information extraction, relies on linguistic tests and aims at the separation of...

In this autobiographical essay I reflect on my training in linguistics and the way it affected my interpretation and development of SFL theory. In particular I am concerned to show how I tried to help SFL evolve, accumulating previous understandings into a model with additional theoretical architecture taking descriptive responsibility for a wider range of linguistic data. This evolution is ill...

This paper establishes a strong completeness property of compositional program logics for pure and imperative higher-order functions introduced in [2, 15–18]. This property, called descriptive completeness, says that for each program there is an assertion fully describing the former’s behaviour up to the standard observational semantics. This formula is inductively calculable from the program t...

I discuss formal description techniques (FDTs) as they are applied in practice in software and system engineering. Their quality can be measured by their formality, descriptiveness and technical usefulness. I discuss shortcomings in the scientific and semantic foundations of FDTs. I formulate requirements for FDTs. I demonstrate how a family of complementary description techniques can be develo...

This paper describes various types of semantic ellipsis and underspecification in natural language, and the ways in which the meaning of semantically elided elements is reconstructed in the Ontological Semantics (OntoSem) text processing environment. The description covers phenomena whose treatment in OntoSem has reached various levels of advancement: fully implemented, partially implemented, a...