Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Studies Of Program Constructs (F.3.3)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 56 Reviews about "Studies Of Program Constructs (F.3.3)": Date Reviewed   Practical optional types for Clojure Bonnaire-Sergeant A., Davies R., Tobin-Hochstadt S.  ESOP 2016 (Proceedings of the 25th European Symposium on Programming,Apr 2-Apr 8, 2016) 68-94, 2016.  Type: Proceedings Clojure is an untyped dynamic Lisp-like language that targets the Java virtual machine (JVM). This paper discusses adding a type system to the language. It is based on real-world work, the Typed Clojure project and core.typed library, ... Nov 22 2016   Foundations of session types and behavioural contracts Hüttel H., Lanese I., Vasconcelos V., Caires L., Carbone M., Deniélou P., Mostrous D., Padovani L., Ravara A., Tuosto E., Vieira H., Zavattaro G. ACM Computing Surveys 49(1): 1-36, 2016.  Type: Article We are familiar with the notion of types as classifying what a program component does and permissible use of the component. A type system will tell us that a method call must have arguments of particular types and guarantee that it wil... Jun 15 2016   Partial interconnection and observer-based dead-beat control of two-dimensional behaviors Bisiacco M., Valcher M. Multidimensional Systems and Signal Processing 26(2): 459-479, 2015.  Type: Article The zero-time-controllability of an observer-based deadbeat controller (DBC) is described in this paper. Deadbeat control is a typical example of linear control strategies in discrete-time systems. The standard objective of deadbeat co... May 18 2016   Recursion: complexity in cognition Roeper T., Speas M., Springer Publishing Company, Incorporated, New York, NY, 2014. 267 pp.  Type: Book (978-3-319050-85-0) In 2002, Hauser, Chomsky and Fitch hypothesized that the narrow faculty of language “only includes recursion and is the only uniquely human component of the faculty of language.” This hypothesis led to a rich resear... Jan 7 2015   A typed store-passing translation for general references Pottier F. ACM SIGPLAN Notices 46(1): 147-158, 2011.  Type: Article It is a challenging task to create a well-typed semantic model for a programming language that supports references to dynamically allocated memory cells that may hold values of any type, such as functions or addresses of other cells. T... Nov 1 2011    Pearls of functional algorithm design Bird R., Cambridge University Press, New York, NY, 2010. 290 pp.  Type: Book (978-0-521513-38-8) Most books on algorithm design are thoroughly imperative, sometimes with a thin veneer of object-oriented lacquer, to appeal to a larger audience. But it is slowly dawning on the computing community that these methods do not work so we... Jul 21 2011   Formally verifying information flow type systems for concurrent and thread systems Barthe G., Nieto L.  Formal methods in security engineering (Proceedings of the 2004 ACM Conference on Formal Methods in Security Engineering, Washington DC, USA, Oct 29, 2004) 13-22, 2004.  Type: Proceedings This paper is in the area of theory related to concurrency and threading. It is about reasoning noninterference properties in a concurrent programming language with information flow type systems. The work uses the proof assistant Isabe... Jan 12 2005   Canonical derivatives, partial derivatives and finite automaton constructions Champarnaud J., Ziadi D. Theoretical Computer Science 289(1): 137-163, 2002.  Type: Article In 1964, J.A. Brzozowski introduced the notion of the derivatives of a regular expression [1]: where u is a word over the alphabet of a regular expression E, the derivative of E ... Nov 3 2003   Types and programming languages Pierce B., MIT Press, Cambridge, MA, 2002. 645 pp.  Type: Book (9780262162098) Pierce defines a type system as “a tractable syntactic method for proving the absence of certain program behaviors by classifying phrases according to the types of values they compute.” Don’t let this for... Jan 24 2003   An interpretation of typed objects into typed &pgr;-calculus Sangiorgi D. Information and Computation 143(1): 34-73, 1998.  Type: Article, Reviews: (1 of 2) It has been widely recognized that while object orientation brings tangible practical benefits to the software development process, its theoretical underpinnings are less clear. This paper fits within a body of research that is respond... Jul 1 1999       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy