Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Theory Of Computation (F) > Logics And Meanings Of Programs (F.3) > Studies Of Program Constructs (F.3.3) > Type Structure (F.3.3...)  
 
Options:
 
  1-10 of 99 Reviews about "Type Structure (F.3.3...)": Date Reviewed
  Implementing a modal dependent type theory
Gratzer D., Sterling J., Birkedal L.  Proceedings of the ACM on Programming Languages 3(ICFP): 1-29, 2019. Type: Article

Modalities are widely used in mathematics and computer science as an abstraction tool, but it turns out to be difficult to incorporate them in rich type theories. The authors address this problem, proposing a new dependent type theory MLTT...

Apr 27 2021
  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-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, which are ap...

Nov 22 2016
  A logical approach to deciding semantic subtyping
Gesbert N., Genevès P., Layaïda N.  ACM Transactions on Programming Languages and Systems 38(1): 1-31, 2015. Type: Article

Although object-oriented subtyping has been efficiently resolved by compilers for years, this paper shows how subtyping in Extensible Markup Language (XML)-centric functional languages can be done with a SAT solver. It gives a tested formal specif...

Jan 11 2016
  A correspondence between type checking via reduction and type checking via evaluation
Sergey I., Clarke D.  Information Processing Letters 112(1-2): 13-20, 2012. Type: Article

This paper deals with the implementation of a type checker for the simply typed lambda calculus in the Standard ML language. A type system is generally defined via a set of predicates that are defined inductively following the structure of the lan...

Mar 25 2013
  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. The essence o...

Nov 1 2011
  Foundations of XML processing: the tree-automata approach
Hosoya H.,  Cambridge University Press, New York, NY, 2010. 238 pp. Type: Book (978-0-521196-13-0)

Extensible Markup Language (XML) is one of the core technologies currently used both for the Web and in data/document-related representations. In most cases, developers use the standard document object model (DOM) approach in their implementations...

Jul 1 2011
  Divide and recycle: types and compilation for a hybrid synchronous language
Benveniste A., Bourke T., Caillaud B., Pouzet M.  LCTES 2011 (Proceedings of the 2011 SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems, Chicago, IL,  Apr 11-14, 2011) 61-70, 2011. Type: Proceedings

Embedded systems have become pervasive. They are prevalent in many aspects of our everyday lives, from controlling cars using anti-lock braking systems (ABSs) to controlling the rhythm of hearts using a pacemaker. All of these systems are discrete...

Jun 10 2011
  A theory of contracts for Web services
Castagna G., Gesbert N., Padovani L.  ACM Transactions on Programming Languages and Systems 31(5): 1-61, 2009. Type: Article

In Web-based computing, services and clients must agree on their contract--the order of the messages to be exchanged--in order to have a successful conversation. In particular, it must be possible to decide whether the contract offered b...

Jul 1 2010
  Computable models
Turner R.,  Springer Publishing Company, Incorporated, London, UK, 2009. 240 pp. Type: Book (9781848820517), Reviews: (2 of 2)

Today’s scientific world has become strongly invested in the generic concept of computational science, that is, constructing computational models and numerical solution techniques that would allow computers to analyze and solve scientific, s...

Nov 2 2009
  Computable models
Turner R.,  Springer Publishing Company, Incorporated, London, UK, 2009. 240 pp. Type: Book (9781848820517), Reviews: (1 of 2)

The title of this book is a misnomer; it suggests a work in recursion theory. In fact, this monograph shows how the Z and Vienna development method (VDM) specification languages, which are based on set theory, can have computable models. Turner al...

Oct 16 2009
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2021 ThinkLoud, Inc.
Terms of Use
| Privacy Policy