English
Related papers

Related papers: Complete Context Calculus Design and Implementatio…

200 papers

We present a symbolic transition system and bisimulation equivalence for psi-calculi, and show that it is fully abstract with respect to bisimulation congruence in the non-symbolic semantics. A psi-calculus is an extension of the…

Logic in Computer Science · Computer Science 2010-02-16 Magnus Johansson , Björn Victor , Joachim Parrow

Long-context language models now advertise context windows up to millions of tokens, yet evaluations typically report a single length or a narrow task family, masking two failure modes: performance can collapse as length grows, and strong…

We introduce a unified Learning Context (LC) framework designed to transition AI-based education from context-blind mimicry to a principled, holistic understanding of the learner. This white paper provides a multidisciplinary roadmap for…

We show that context semantics can be fruitfully applied to the quantitative analysis of proof normalization in linear logic. In particular, context semantics lets us define the weight of a proof-net as a measure of its inherent complexity:…

Logic in Computer Science · Computer Science 2009-09-29 Ugo Dal Lago

We introduce refutationally complete superposition calculi for intentional and extensional clausal $\lambda$-free higher-order logic, two formalisms that allow partial application and applied variables. The calculi are parameterized by a…

Logic in Computer Science · Computer Science 2023-06-22 Alexander Bentkamp , Jasmin Blanchette , Simon Cruanes , Uwe Waldmann

During complex knowledge work, people engage in iterative sensemaking: interpreting information, connecting ideas, and refining their understanding. Yet in current human-AI collaboration, these cognitive processes are difficult to share and…

Human-Computer Interaction · Computer Science 2026-04-14 Yoonsu Kim , Chanbin Park , Kihoon Son , Saelyne Yang , Juho Kim

Linear type systems need to keep track of how programs use their resources. The standard approach is to use context splits specifying how resources are (disjointly) split across subterms. In this approach, context splits redundantly echo…

Logic in Computer Science · Computer Science 2021-09-06 Uma Zalakain , Ornela Dardha

Learning Spaces are certain set systems that are applied in the mathematical modeling of education. We propose a suitable compression (without loss of information) of such set systems to facilitate their logical and statistical analysis.…

Data Structures and Algorithms · Computer Science 2017-08-14 Marcel Wild

We present an extension of System F with higher-order context-free session types. The mixture of functional types with session types has proven to be a challenge for type equivalence formalization: whereas functional type equivalence is…

Logic in Computer Science · Computer Science 2022-03-25 Diana Costa , Andreia Mordido , Diogo Poças , Vasco T. Vasconcelos

The Word-in-Context (WiC) task has attracted considerable attention in the NLP community, as demonstrated by the popularity of the recent MCL-WiC SemEval shared task. Systems and lexical resources from word sense disambiguation (WSD) are…

Computation and Language · Computer Science 2022-05-11 Bradley Hauer , Grzegorz Kondrak

Capture calculus has recently been proposed as a solution to effect checking, achieved by tracking the captured references of terms in the types. Boxes, along with the box and unbox operations, are a crucial construct in capture calculus,…

Programming Languages · Computer Science 2023-06-13 Yichen Xu , Martin Odersky

Karl Marx once wrote that ``the human essence is the ensemble of social relations'', suggesting that individuals are not isolated entities but are fundamentally shaped by their interactions with other entities, within which contexts play a…

Artificial Intelligence · Computer Science 2025-10-31 Qishuo Hua , Lyumanshan Ye , Dayuan Fu , Yang Xiao , Xiaojie Cai , Yunze Wu , Jifan Lin , Junfei Wang , Pengfei Liu

We describe a process calculus featuring high level constructs for component-oriented programming in a distributed setting. We propose an extension of the higher-order pi-calculus intended to capture several important mechanisms related to…

Programming Languages · Computer Science 2009-09-04 Daniel Hirschkoff , Aurélien Pardon , Tom Hirschowitz , Samuel Hym , Damien Pous

Software security can be ensured by specifying and verifying security properties of software using formal methods with strong theoretical bases. In particular, programs can be modeled in the framework of lambda-calculi, and interesting…

Logic in Computer Science · Computer Science 2009-04-08 Slawomir Lasota , David Nowak , Yu Zhang

Concept lattices are well-known conceptual structures that organise interesting patterns-the concepts-extracted from data. In some applications, such as software engineering or data mining, the size of the lattice can be a problem, as it is…

Artificial Intelligence · Computer Science 2018-02-13 Giacomo Kahn , Alexandre Bazin

Context-free session types provide a typing discipline for recursive structured communication protocols on bidirectional channels. They overcome the restriction of regular session type systems to tail recursive protocols. This extension…

Programming Languages · Computer Science 2022-08-03 Bernardo Almeida , Andreia Mordido , Peter Thiemann , Vasco T. Vasconcelos

We relate our previous as well as ongoing research in the domain of smart homes to the concept of HabiTech. HabiTech can benefit from existing approaches and findings in a broader context of whole buildings or communities within. Along with…

Human-Computer Interaction · Computer Science 2025-06-12 Albrecht Kurze , Karola Köpferl

Topic segmentation is important in understanding scientific documents since it can not only provide better readability but also facilitate downstream tasks such as information retrieval and question answering by creating appropriate…

Computation and Language · Computer Science 2023-01-06 Jeonghwan Lee , Jiyeong Han , Sunghoon Baek , Min Song

This paper deals with the probabilistic behaviours of distributed systems described by a process calculus considering both probabilistic internal choices and nondeterministic external choices. For this calculus we define and study a typing…

Logic in Computer Science · Computer Science 2019-09-05 Bogdan Aman , Gabriel Ciobanu

We study coupled logical bisimulation (CLB) to reason about contextual equivalence in the lambda-calculus. CLB originates in a work by Dal Lago, Sangiorgi and Alberti, as a tool to reason about a lambda-calculus with probabilistic…

Logic in Computer Science · Computer Science 2014-10-13 Ryan Kavanagh , Jean-Marie Madiot
‹ Prev 1 4 5 6 7 8 10 Next ›