A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Results demonstrate that children in immersion programs have greater sensitivity to FM, but not RT, controlling for various factors. ... to children in general English education programs. ... performance for the SpanI program, but instead found no significant difference across languages for RT. ...doi:10.3389/fpsyg.2021.687651 pmid:34733197 pmcid:PMC8558524 fatcat:oik27uqyavg57bfb7nheaf6ay4
We survey existing proposals for precise statements of such security guarantees, and argue that the notion of full abstraction proposed by Martín Abadi as a correctness condition for secure implementation ... We give a brief overview of how full abstraction has already been used to specify and prove security for important building blocks of an execution infrastructure, and we sketch a research agenda identifying ... The authors thank the participants of the Secure Compilation workshop held in August 2016 at INRIA Paris for the interesting and useful discussions closely related to the topic of this paper. ...doi:10.1109/secdev.2016.030 dblp:conf/secdev/PiessensDMS16 fatcat:l2fbk3akovdh3prfyjcbgc5fty
In this position paper, we want to help the reader to evaluate the real benefits of using such a notion when studying the expressiveness of programming languages. ... What does it mean that an encoding is fully abstract? What does itnotmean? ... We further thank Kirstin Peters for stimulating discussions and proof-reading, and Catuscia Palamidessi for the long-term exchange on the subject and for encouraging us to actually write down our position ...doi:10.1017/s0960129514000279 fatcat:h44cen4sevcclfz23v4kpkiyse
Rather than defining a new analysis from scratch for each programming language, we would like to specify such an analysis once and for all, in a language-independent way, and then specialize it for different ... Summary: “Slicing analyses have been proposed for different pro- gramming languages. ...
In this note, we review the relation between definability and full abstraction, and we put a few old and recent results of this kind in perspective. ... It offers among other things an attractive classification of programming features, and has brought a bunch of new definability results. ... In this short note, we recast the relation between definability and full abstraction, and examine the status of older and more recent results with respect to these two related notions. ...doi:10.1016/j.entcs.2007.02.011 fatcat:y65s4eku4ja75n3t3pam3wd3py
Both full abstractness results are obtained using logical relations and thus do not use our techniques. ... Furthermore, expressivity results between different programming languages are usually obtained by mapping one programming language into another one. ...doi:10.1016/j.tcs.2015.02.027 fatcat:3pl4smjufnbploj5gzv7jaj5ma
different programming languages. ... Our evaluation shows that our approach obtains better results than task-specific handcrafted representations across different tasks and programming languages. ... The research leading to these results has received funding from the European Union's Seventh Framework Programme (FP7) under grant agreement no. 615688-ERC-COG-PRIME. ...arXiv:1803.09544v3 fatcat:46o247qxbzdo5hbhayx6uoiq6a
A compiler is fully-abstract if the compilation from source language programs to target language programs reflects and preserves behavioural equivalence. ... Based on this insight, we describe a general technique for proving compiler full-abstraction and demonstrate it on a compiler from STLC to ULC. ... Although logical relations have been used for full-abstraction proofs, this is the first usage of cross-language logical relations for compiler full-abstraction targeting an untyped language. ...arXiv:1703.09988v3 fatcat:ml7o3mrrbnc3fn7hcwxipyggmu
If we had better tools for analyzing the programming language literature, we might be able to answer these questions and others like them in a data-driven way. ... Does a proposed program committee cover the range of submissions expected for the conference? ... We manually highlighted various words occuring in the abstract: yellow for words related to components, green for words related type systems, and blue for words related to Object-Oriented Programming ( ...doi:10.4230/lipics.snapl.2015.140 dblp:conf/snapl/GreenbergFW15 fatcat:dcjgbm5ycnbe7mhctv4golfx3q
We present axioms on models of PCF from which the key results on definability and full abstraction can be proved. It should be emphasized that not only the results of a paper by Abramsky, R. ... We hope that it will lead to further work in a number of directions: (1) a more abstract perspective on game semantics, (2) a synthetic/axiomatic account of sequentiality, (3) general results on full abstraction ...
We have chosen the latter approach, and as part of this effort, we have tried to isolate exactly what capabilities distinguish a full object-oriented programming language from an abstraction-oriented programming ... The next revision of the language is now being prepared, and is designated Ada 9X. This revision will support full object-oriented programming. ... Introduction Ada 83  is an abstraction-oriented programming language. ...doi:10.1145/165854.165877 dblp:conf/oopsla/Taft93 fatcat:be3rrnrvfvgd3h63xr52v6dfmu
Lecture Notes in Computer Science
We discuss abstractions for protection and the correctness of their implementations. ... Relying on the concept of full abstraction, we consider two examples: (1) the translation of Java classes to an intermediate bytecode language, and (2) in the setting of the pi calculus, the implementation ... Closely related to equational full abstraction is logical full abstraction. ...doi:10.1007/bfb0055109 fatcat:jj3xjssqv5grbjavhboxuupbim
Lecture Notes in Computer Science
We discuss abstractions for protection and the correctness of their implementations. ... Relying on the concept of full abstraction, we consider two examples: (1) the translation of Java classes to an intermediate bytecode language, and (2) in the setting of the pi calculus, the implementation ... Closely related to equational full abstraction is logical full abstraction. ...doi:10.1007/3-540-48749-2_2 fatcat:477gqvzrn5fcjp72b4rjgjvdvu
Although subjective expressions and linguistic fluency have been shown as important factors in processing and interpreting textual facts, analyses of these traits in textual health information for different ... We analyzed the readability and linguistic psychological and emotional characteristics of different textual summary formats of Cochrane systematic reviews. ... Supplement Full data set analysis of language characteristics for summary formats. ...doi:10.1186/s12874-019-0716-x pmid:30953453 pmcid:PMC6451281 fatcat:62qyd24dpvdg5ciu7lamjuv4jy
We prove the first full abstraction result for a translation whose target language contains exceptions, but the source does not. ... Proving full abstraction for realistic compilers is challenging because realistic target languages contain features (such as control effects) unavailable in the source, while proofs of full abstraction ... Our work is the first full abstraction result where the target language contains exceptions but the source does not. Like AB08, Fournet et al. use type-based invariants to prove full abstraction. ...doi:10.1145/2951913.2951941 dblp:conf/icfp/NewBA16 fatcat:pcxdfxryxfeabey5d2rgkabu4q
« Previous Showing results 1 — 15 out of 348,728 results