Results 21 to 30 of about 4,260 (299)
Explicit programming strategies [PDF]
Empirical Software Engineering, 2020 Software developers solve a diverse and wide range of problems. While software engineering research often focuses on tools to support this problem solving, the strategies that developers use to solve problems are at least as important. In this paper, we offer a novel approach for enabling developers to follow explicit programming strategies that ...
Thomas D. LaToza +3 more
openaire +4 more sources
EXPLICITATION STRATEGY IN TRANSLATING AN INDONESIAN NOVEL INTO ENGLISH
Lire Journal, 2023 TThis research article is about the use of translation strategy namely explicitation in the translation of a novel from Indonesian into English. The data source is an Indonesian novel entitled Lelaki Harimau written by Eka Kurniawan and its English ...
Erlina Zulkifli Mahmud, Cece Sobarna
doaj +1 more source
Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '90, 1990 Abstract The λσ-calculus is a refinement of the λ-calculus where substitutions are manipulated explicitly. The λσ-calculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical λ-calculus and concrete implementations.
Abadi, Martin +3 more
openaire +4 more sources
Terms for explicitation in Croatian [PDF]
, 2021 Eksplicitacija, eksplicitnost ili eksplikacija je pomak u prevođenju kojim prijevodni tekst postaje jezično redundantniji. Eksplicitacija kao jedan od najranije definiranih i najviše istraživanih postupaka u prevođenju, smatra se i univerzalnom ...
Tominac Coslovich, Sandra +3 more
core +1 more source
Smaller Explicit Superconcentrators [PDF]
Internet Mathematics, 2004 Summary: Using a new recursive technique, we present an explicit construction of an infinite family of \(N\)-superconcentrators of density 44. The most economical previously known explicit graphs of this type have density around 60.
Alon, N., Capalbo, M.
openaire +5 more sources
Combinatorics of Explicit Substitutions [PDF]
Proceedings of the 20th International Symposium on Principles and Practice of Declarative Programming, 2018 $λ\upsilon$ is an extension of the $λ$-calculus which internalises the calculus of substitutions. In the current paper, we investigate the combinatorial properties of $λ\upsilon$ focusing on the quantitative aspects of substitution resolution. We exhibit an unexpected correspondence between the counting sequence for $λ\upsilon$-terms and famous Catalan
Bendkowski, Maciej, Lescanne, Pierre
openaire +4 more sources
Theoretical Computer Science, 2000 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Lucian Wischik, Philippa Gardner
openaire +4 more sources
, 2018 The Calculus of Audited Units (CAU) is a typed lambda calculus resulting from a computational interpretation of Artemov's Justification Logic under the Curry-Howard isomorphism; it extends the simply typed lambda calculus by providing audited types, inhabited by expressions carrying a trail of their past computation history.
Wilmer Ricciotti, James Cheney
openaire +4 more sources
On Explicit Constructions of Designs
The Electronic Journal of Combinatorics, 2022 An $(n,r,s)$-system is an $r$-uniform hypergraph on $n$ vertices such that every pair of edges has an intersection of size less than $s$. Using probabilistic arguments, Rödl and Šiňajová showed that for all fixed integers $r> s \ge 2$, there exists an $(n,r,s)$-system with independence number $O\left(n^{1-\delta+o(1)}\right)$ for some optimal ...
Xizhi Liu, Dhruv Mubayi
openaire +3 more sources
American, British and Canadian Studies Journal, 2023 A complex process that necessarily goes beyond the surface level of words and phrases, (literary) translation is also a means to understand the cultures whose products the translated texts are.
Ciubăncan Magdalena
doaj +1 more source