Results 21 to 30 of about 432,853 (282)
Chinese Calligraphy: An Ancient Art in the Modern Era [PDF]
SHS Web of Conferences, 2023 Chinese calligraphy is an ancient character writing art. It germinated in the Shang Dynasty, reached its peak in the Tang Dynasty, and did not form a new calligraphy style for more than one thousand years.
Chen Ziyuan
doaj +1 more source
, 2023 Structured recursion schemes such as folds and unfolds have been widely used for structuring both functional programs and program semantics. In this context, it has been customary to implement denotational semantics as folds over an inductive data type to ensure termination and compositionality.
Paviotti, Marco, Wu, Nicolas
openaire +2 more sources
Disentangling Parallelism and Interference in Game Semantics [PDF]
Logical Methods in Computer ScienceGame semantics is a denotational semantics presenting compositionally the computational behaviour of various kinds of effectful programs. One of its celebrated achievement is to have obtained full abstraction results for programming languages with a ...
Simon Castellan, Pierre Clairambault
doaj +1 more source
On the Economic Focus of Conciliar Trinitarianism
TheoLogica, 2020 This article suggests that the shape of Conciliar Trinitarianism is rather different to what is often supposed in recent theological treatments of the Trinity.
Declan O'Byrne
doaj +1 more source
Analysis of large-scale UHF-RFID use-cases utilizing full-wave simulation techniques [PDF]
Advances in Radio Science, 2021 UHF-RFID is a mature and widespread technology that has the potential to increase the reliability and efficiency of processes in logistics and production environments.
M. Lach, C. Looschen, E. Biebl
doaj +1 more source
On Feller continuity and full abstraction
Proceedings of the ACM on Programming Languages, 2022 We study the nature of applicative bisimilarity in λ-calculi endowed with operators for sampling from contin- uous distributions. On the one hand, we show that bisimilarity, logical equivalence, and testing equivalence all coincide with contextual equivalence when real numbers can be manipulated through continuous functions only.
Gilles Barthe +3 more
openaire +2 more sources
A fully-abstract semantics of lambda-mu in the pi-calculus [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to weak ...
Steffen van Bakel +1 more
doaj +1 more source
Compulsory coding in education: liberal-humanism, Baudrillard and the ‘problem’ of abstraction
Research and Practice in Technology Enhanced Learning, 2019 Internationally, coding is increasingly introduced into primary and junior high schools (children generally aged between 5 and 15) on a compulsory basis, though not all stakeholders support this ‘initiative’.
Laurence Tamatea
doaj +1 more source
Variability Abstraction and Refinement for Game-Based Lifted Model Checking of Full CTL [PDF]
, 2019 One of the most promising approaches to fighting the configuration space explosion problem in lifted model checking are variability abstractions. In this work, we define a novel game-based approach for variability-specific abstraction and refinement for ...
A Campetelli +20 more
core +1 more source
Full abstraction, totality and PCF [PDF]
Mathematical Structures in Computer Science, 1999 Inspired by a question of Riecke, we consider the interaction of totality and full abstraction, asking whether full abstraction holds for Scott's model of cpos and continuous functions if one restricts to total programs and total observations. The answer is negative, as there are distinct operational and denotational notions of totality. However,
openaire +3 more sources