English
Related papers

Related papers: Ad-hoc polymorphic delimited continuations

200 papers

Autoregressive models have driven remarkable progress in language modeling. Their foundational reliance on discrete tokens, unidirectional context, and single-pass decoding, while central to their success, also inspires the exploration of a…

We show how to smoothly incorporate in the object-oriented paradigm constructs to raise, compose, and handle effects in an arbitrary monad. The underlying pure calculus is meant to be a representative of the last generation of OO languages,…

Programming Languages · Computer Science 2025-04-23 Francesco Dagnino , Paola Giannini , Elena Zucca

Multi-methods are a straightforward extension of traditional (single) dynamic dispatch, which is the core of most object oriented languages. With multi-methods, a method call will select an appropriate implementation based on the values of…

Programming Languages · Computer Science 2019-10-03 Isaac Oscar Gariano , Marco Servetto

We present a novel approach to construction of a formal semantics for a programming language. Our approach, using a parametric denotational semantics, allows the semantics to be easily extended to support new language features, and…

Programming Languages · Computer Science 2018-12-04 In-Ho Yi

Diffusion Language Models (DLMs) offer a promising alternative for language modeling by enabling parallel decoding through iterative refinement. However, most DLMs rely on hard binary masking and discrete token assignments, which hinder the…

Computation and Language · Computer Science 2026-01-19 Linhao Zhong , Linyu Wu , Bozhen Fang , Tianjian Feng , Chenchen Jing , Wen Wang , Jiaheng Zhang , Hao Chen , Chunhua Shen

Context. An extension method is a method declared in a package other than the package of its host class. Thanks to extension methods, developers can adapt to their needs classes they do not own: adding methods to core classes is a typical…

Programming Languages · Computer Science 2017-08-08 Guillermo Polito , Camille Teruel , Stéphane Ducasse , Luc Fabresse

Large Language Models (LLMs) have demonstrated remarkable language understanding and generation capabilities. However, training, deploying, and accessing these models pose notable challenges, including resource-intensive demands, extended…

Computation and Language · Computer Science 2024-01-31 Souvika Sarkar , Mohammad Fakhruddin Babar , Monowar Hasan , Shubhra Kanti Karmaker

Filter pruning and low-rank decomposition are two of the foundational techniques for structured compression. Although recent efforts have explored hybrid approaches aiming to integrate the advantages of both techniques, their performance…

Machine Learning · Computer Science 2023-09-26 Moonjung Eo , Suhyun Kang , Wonjong Rhee

Large Language Models (LLMs) are transforming language sciences. However, their widespread deployment currently suffers from methodological fragmentation and a lack of systematic soundness. This study proposes two comprehensive…

Computation and Language · Computer Science 2025-12-11 Kun Sun , Rong Wang

The rise of generative chat-based Large Language Models (LLMs) over the past two years has spurred a race to develop systems that promise near-human conversational and reasoning experiences. However, recent studies indicate that the…

Computation and Language · Computer Science 2025-03-11 Daniel Guzman-Olivares , Lara Quijano-Sanchez , Federico Liberatore

Component-based software engineering (CBSE) decomposes complex systems into reusable components. Model-driven engineering (MDE) aims to abstract from complexities by lifting abstract models to primary development artifacts. Component and…

Software Engineering · Computer Science 2015-11-02 Lars Hermerschmidt , Katrin Hölldobler , Bernhard Rumpe , Andreas Wortmann

Domain-specific languages (DSLs) are both pervasive and powerful, but remain difficult to integrate into large projects. As a result, while DSLs can bring distinct advantages in performance, reliability, and maintainability, their use often…

Programming Languages · Computer Science 2020-10-19 Hal Finkel , Alexander McCaskey , Tobi Popoola , Dmitry Lyakh , Johannes Doerfert

A general framework is proposed for integration of rules and external first order theories. It is based on the well-founded semantics of normal logic programs and inspired by ideas of Constraint Logic Programming (CLP) and constructive…

Logic in Computer Science · Computer Science 2010-12-08 W. Drabent , J. Maluszynski

Pre-trained word embeddings are widely used for transfer learning in natural language processing. The embeddings are continuous and distributed representations of the words that preserve their similarities in compact Euclidean spaces.…

Computation and Language · Computer Science 2020-06-25 Halid Ziya Yerebakan , Parmeet Bhatia , Yoshihisa Shinagawa

This paper concerns the development of metatheory for extensible languages. It uses as its starting point a view that programming languages tailored to specific application domains are to be constructed by composing components from an open…

Programming Languages · Computer Science 2023-12-25 Dawn Michaelson , Gopalan Nadathur , Eric Van Wyk

Deep learning models (DLMs) achieve increasingly high performance both on structured and unstructured data. They significantly extended applicability of machine learning to various domains. Their success in making predictions, detecting…

Artificial Intelligence · Computer Science 2025-01-03 Matej Mihelčić , Ivan Grubišić , Miha Keber

The thesis develops a view of design in a concept formation framework and outlines a language to describe both the object of the design and the process of designing. The unknown object at the outset of the design work may be seen as an…

Artificial Intelligence · Computer Science 2024-04-23 Arnulf Hagen

External or internal domain-specific languages (DSLs) or (fluent) APIs? Whoever you are -- a developer or a user of a DSL -- you usually have to choose your side; you should not! What about metamorphic DSLs that change their shape according…

Programming Languages · Computer Science 2014-04-29 Mathieu Acher , Benoit Combemale , Philippe Collet

Recently an extension to higher-order logic -- called DHOL -- was introduced, enriching the language with dependent types, and creating a powerful extensional type theory. In this paper we propose two ways how choice can be added to DHOL.…

Logic in Computer Science · Computer Science 2024-10-14 Daniel Ranalter , Chad E. Brown , Cezary Kaliszyk

This paper is concerned with a class of algorithms that perform exhaustive search on propositional knowledge bases. We show that each of these algorithms defines and generates a propositional language. Specifically, we show that the trace…

Artificial Intelligence · Computer Science 2011-10-13 A. Darwiche , J. Huang