Sciweavers

458 search results - page 81 / 92
» Imperative Programming with Dependent Types
Sort
View
JFP
2007
111views more  JFP 2007»
13 years 8 months ago
Mechanizing metatheory in a logical framework
The LF logical framework codifies a methodology for representing deductive systems, such as programming languages and logics, within a dependently typed λ-calculus. In this meth...
Robert Harper, Daniel R. Licata
CACM
2000
120views more  CACM 2000»
13 years 8 months ago
Universal Usability
ost abstract sense, we build web pages so that computers can read them. The software that people use to access web pages is what "reads" the document. How the page is ren...
Ben Shneiderman
COLING
2002
13 years 8 months ago
Creating a Finite-State Parser with Application Semantics
Parsli is a finite-state (FS) parser which can be tailored to the lexicon, syntax, and semantics of a particular application using a hand-editable declarative lexicon. The lexicon...
Owen Rambow, Srinivas Bangalore, Tahir Butt, Alexi...
ICSE
2005
IEEE-ACM
14 years 8 months ago
Eliciting design requirements for maintenance-oriented IDEs: a detailed study of corrective and perfective maintenance tasks
Recently, several innovative tools have found their way into mainstream use in modern development environments. However, most of these tools have focused on creating and modifying...
Andrew Jensen Ko, Htet Htet Aung, Brad A. Myers
LICS
2009
IEEE
14 years 3 months ago
Functional Reachability
—What is reachability in higher-order functional programs? We formulate reachability as a decision problem in the setting of the prototypical functional language PCF, and show th...
C.-H. Luke Ong, Nikos Tzevelekos