Results 231 to 240 of about 5,477,919 (290)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
An Intrinsically-Typed Solution for the List-Machine Benchmark
Proceedings of the 24th Brazilian Symposium on Context-Oriented Programming and Advanced Modularity, 2020Formal models are important tools in the programming language research community. However, such models are full of intricacies and, due to that, they are subject to subtle errors. Such failures motivated the usage of tools to ensure the correctness of these formalisms. One way to eliminate such errors is to encode models in a dependently-typed language
Samuel Feitosa, Rodrigo Ribeiro
openaire +1 more source
2021
Typescript list of Cuala Press Prints. The list describes prints where the Cuala Press catalogue numbers are unknown, or the prints could not be found. List likely created by the donor before the collection was handed over to the Manuscripts and Archives Research Library.
openaire +1 more source
Typescript list of Cuala Press Prints. The list describes prints where the Cuala Press catalogue numbers are unknown, or the prints could not be found. List likely created by the donor before the collection was handed over to the Manuscripts and Archives Research Library.
openaire +1 more source
Brooks-Type Theorems for Pair-List Colorings and List Homomorphisms
SIAM Journal on Discrete Mathematics, 2008Brooks proved that every connected graph other than a clique or odd cycle can be colored with $\Delta$ colors. Erdos, Rubin, and Taylor (and, independently, Vizing) generalized the theorem of Brooks to list colorings, describing all uncolorable connected graphs in which no vertex has a list smaller than its degree.
Tomás Feder +2 more
openaire +1 more source
Stimulus Type and the List Strength Paradigm
Quarterly Journal of Experimental Psychology, 2014In recognition memory, increasing the strength of studied items does not reduce performance on other items, an effect dubbed the null list strength effect (LSE). While this finding has been replicated many times, it has rarely been tested using stimuli other than single words.
Osth, A., Dennis, S., Kinnell, A.
openaire +3 more sources
Effects of List Types and Cues on the Learning of Word Lists
Reading Research Quarterly, 1970GIVES SIX instructional methods for initial reading vocabulary acquisition involving two list types (minimal and maximal) combined with three sources of cue (the word itself, a context cue, a picture cue), using 127 first-graders divided into six treatment groups.
openaire +1 more source
The Type of Preferences in Ranking Lists
2011We consider the situation when we dispose several lists of ordered objects (stages, objects etc.) and we use it to create final list of assigned objects or classificated objects. Moreover we permit the continuous inflow of new object and outflow chosen to realization objects.
Piech Henryk, Grzegorz Gawinowski
openaire +1 more source
List-tracing in systems allowing multiple cell-types
Proceedings of the second ACM symposium on Symbolic and algebraic manipulation - SYMSAC '71, 1971List-processing systems have each allowed the use of only a single size and configuration of list cell. In this paper a system is described which allows the use of arbitrarily many different sizes and configurations of list cells, possibly not specified until run time.
openaire +1 more source
A list-type storage technique for alphanumeric information
Communications of the ACM, 1963A method which is economic in terms of space and time is proposed for the storage and manipulation of character strings of arbitrary length in a fixed word-length computer. The method is illustrated in an application to Algol-type identifiers in an Algol-like block structure.
openaire +1 more source
2000
Abstract In this chapter we shall be concerned with arrays of objects of given type, and with how to handle these arrays in a variety of applications in which the ordering of the elements of the array (ie, of the individual objects) matters.
openaire +1 more source
Abstract In this chapter we shall be concerned with arrays of objects of given type, and with how to handle these arrays in a variety of applications in which the ordering of the elements of the array (ie, of the individual objects) matters.
openaire +1 more source