Filters








31,028 Hits in 4.4 sec

On Jones-Optimal Specialization for Strongly Typed Languages [chapter]

Henning Makholm
2000 Lecture Notes in Computer Science  
We extend recent w ork by Hughes and by T aha and Makholm on the long-unsolved problem of Jones-optimal specialization for strongly typed languages.  ...  We argue that the 1993 de nition of Jones-optimality is in principle impossible to ful l for strongly typed languages due to necessary encodings on the inputs and outputs of a well-typed self-interpreter  ...  Jones, Walid Taha, Peter Thiemann, and Morten Welinder for constructive discussions and helpful advice on presenting and improving the results reported here.  ... 
doi:10.1007/3-540-45350-4_11 fatcat:ceauxjzwsjbp3oyhs2cmsfd4hq

Jones optimality, binding-time improvements, and the strength of program specializers

Robert Glück
2002 Proceedings of the ASIAN symposium on Partial evaluation and semantics-based program manipulation - ASIA-PEPM '02  
specializer which is Jones optimal.  ...  Jones optimality tells us that a program specializer is strong enough to remove an entire level of self-interpretation.  ...  Special thanks are due to the anonymous reviewers for thorough and careful reading of the submitted paper and for providing many valuable comments.  ... 
doi:10.1145/568173.568175 dblp:conf/pepm/Gluck02 fatcat:f2qb5ntfc5echmgdx4efm7h5ye

Strategic directions in research on programming languages

Chris Hankin, Hanne Riis Nielson, Jens Palsberg
1996 ACM Computing Surveys  
the use of strongly typed programming languages.  ...  Known ideas on structural type matching, type systems for concurrency, and types for security should be extended and complemented.  ... 
doi:10.1145/242223.242260 fatcat:2sclpyoyifhphbllsjoankrypu

Using experiential optimization to build lexical representations

Brendan T. Johns, Michael N. Jones, D. J. K. Mewhort
2018 Psychonomic Bulletin & Review  
We demonstrate performance on multiple benchmark tasks by optimizing the experience on which a model's representation is based.  ...  Although most language-related theories acknowledge a large role for experience in language processing, variability reflecting that knowledge is usually ignored when evaluating a model's fit to representative  ...  Fig. 4 Results of experiential optimization on the TOEFL task for BEAGLE's three representation types.  ... 
doi:10.3758/s13423-018-1501-2 pmid:29968206 fatcat:bn25y57rxzbarcj45dddqplkeq

Against Cumulative Type Theory [article]

Tim Button, Robert Trueman
2021 arXiv   pre-print
However, Linnebo and Rayo (2012) have advocated for the use of Cumulative Type Theory, CTT, which has more relaxed type-restrictions: according to CTT, b^β(a^α) is well-formed iff β > α.  ...  We end by examining an alternative approach to cumulative types due to Florio Jones (2021); we argue that their theory is best seen as a misleadingly formulated version of STT.  ...  for Review of Symbolic Logic.  ... 
arXiv:2108.04582v1 fatcat:urxre32bvnd47bew6ubvl54hlq

Integrating Model Checking and Theorem Proving in a Reflective Functional Language [chapter]

Tom Melham
2004 Lecture Notes in Computer Science  
Forte is a formal verification system developed by Intel's Strategic CAD Labs for applications in hardware design and verification.  ...  This provides combination of pattern-matching and reflection features tailored especially for the Forte approach to verification.  ...  The research reported in this paper was done in collaboration with Jim Grundy and John O'Leary at Intel, and builds on the Forte work of Carl Seger, Robert Jones, and Mark Aagaard.  ... 
doi:10.1007/978-3-540-24756-2_3 fatcat:n7ej4qybmncltl7eqpmxzzhmcm

Human kinship, from conceptual structure to grammar

Doug Jones
2010 Behavioral and Brain Sciences  
The conceptual structure of kinship seems to borrow its organization from the conceptual structure of space, while being specialized for representing genealogy.  ...  Kin terms from two languages, English and Seneca, show how terminologies that look very different on the surface may result from variation in the rankings of a universal set of constraints.  ...  On this account, Dravidian and Iroquois cousin terms fall along a markedness gradient with respect to unilineal or parallel/cross distinctions, addressing the concerns of Kronenfeld and McConvell about  ... 
doi:10.1017/s0140525x10000890 pmid:21205333 fatcat:63qvml46trfkzmp2eaqexs7xnq

Kinship terms are not kinship

Maurice Bloch
2010 Behavioral and Brain Sciences  
The conceptual structure of kinship seems to borrow its organization from the conceptual structure of space, while being specialized for representing genealogy.  ...  Kin terms from two languages, English and Seneca, show how terminologies that look very different on the surface may result from variation in the rankings of a universal set of constraints.  ...  On this account, Dravidian and Iroquois cousin terms fall along a markedness gradient with respect to unilineal or parallel/cross distinctions, addressing the concerns of Kronenfeld and McConvell about  ... 
doi:10.1017/s0140525x10001949 fatcat:xv3qq7zarfepvjx32pucp5vpku

Static semantics, types, and binding time analysis

Neil D. Jones
1991 Theoretical Computer Science  
Jones, N.D., Static semantics, types, and binding time analysis, Theoretical Computer Science 90 (1991), 95-118.  ...  If the interpreter is written in a strongly typed language, there must be provision for a "case on type tag". Programs with type errors can be run.  ...  and "what is a type?" -roughly, one for every different computer language.  ... 
doi:10.1016/0304-3975(91)90301-h fatcat:6fexemnntvgn7o64gunno2wqja

Statically typed linear algebra in Haskell

Frederik Eaton
2006 Proceedings of the 2006 ACM SIGPLAN workshop on Haskell - Haskell '06  
Typical matrix languages are weakly-typed.  ...  We call this idea "strongly typed linear algebra" and describe a prototype implementation in which dimensions are exposed to the type system, which is based on Alberto Ruiz's GSLHaskell [Ruiz(2005) ] and  ...  , and to Ralf Lammel for patiently explaining his generics library.  ... 
doi:10.1145/1159842.1159859 dblp:conf/haskell/Eaton06 fatcat:zzf6yr5ymrfm7ktv65yezfzssm

Partial evaluation as a means for inferencing data structures in an applicative language

H. Jan Komorowski
1982 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '82  
Eijorner and Jones 78] D Bjorner, C B Jones, eds, The Vienna Development Wlethod: The Me*a-Language, Lecture Notes in Computer Science, Vol 61, Springer-Verlag, 1978.  ...  This observation was first made by Futamura and our experiment confirms it strongly. Ershov and Itkin also obtain a similar result, however for a much weaker language.  ... 
doi:10.1145/582153.582181 dblp:conf/popl/Komorowski82 fatcat:nzaj4kdn5rgenpduftst2useu4

Hand-writing program generator generators [chapter]

Lars Birkedal, Morten Welinder
1994 Lecture Notes in Computer Science  
To the best of our knowledge, our prototype is the first succesfully implemented hand-written program generator generator for a statically typed language.  ...  Moreover, we report on some promising experiments made with a prototype implementation of a program generator generator for most of the Standard ML Core Language.  ...  Jones, and to the rest of the DIKU Topps Group for advice and helpful comments on this work.  ... 
doi:10.1007/3-540-58402-1_15 fatcat:umsmyv6uy5bzrf5ev3lcg6tuy4

On Extracting Static Semantics

John Hannan
2001 Electronical Notes in Theoretical Computer Science  
We need to find techniques for automatically constructing static analyses that are provably correct.  ...  As languages become more complex, the static analyses also become more complex, and consistency proofs have typically been challenging.  ...  Static type checking of strongly typed languages is a good example of this.  ... 
doi:10.1016/s1571-0661(04)80961-7 fatcat:k6dzrqfcybdgzlzmmpmvwf6lpy

On Extracting Static Semantics [chapter]

John Hannan
2002 Lecture Notes in Computer Science  
We need to find techniques for automatically constructing static analyses that are provably correct.  ...  As languages become more complex, the static analyses also become more complex, and consistency proofs have typically been challenging.  ...  Static type checking of strongly typed languages is a good example of this.  ... 
doi:10.1007/3-540-36377-7_8 fatcat:5aox5xuo5fazzoqfixzsgtnhme

Circular reference attributed grammars — their evaluation and applications

Eva Magnusson, Görel Hedin
2007 Science of Computer Programming  
We also present a general demand-driven evaluation algorithm for CRAGs and some optimizations of it.  ...  The approach has been implemented and experimental results include computations on a series of grammars including that of Java 1.2.  ...  Acknowledgements We are grateful to John Boyland and the anonymous reviewers for valuable feedback and helpful comments.  ... 
doi:10.1016/j.scico.2005.06.005 fatcat:hkqkf4tydnb77ioya3gawad56e
« Previous Showing results 1 — 15 out of 31,028 results