4757 search results - page 265 / 952 » Monads for Functional Programming |
172
click to vote
FSTTCS
2007
Springer
16 years 22 days ago
2007
Springer
Abstract. Pushdown systems (PDSs) are an automata-theoretic formalism for specifying a class of infinite-state transition systems. Infiniteness comes from the fact that each con...
172
click to vote
PPPJ
2006
ACM
16 years 16 days ago
2006
ACM
Concept assignment identifies units of source code that are functionally related, even if this is not apparent from a syntactic point of view. Until now, the results of concept a...
224
click to vote
ESOP
2005
Springer
16 years 3 days ago
2005
Springer
JavaScript is a popular language for client-side web scripting. It has a dubious reputation among programmers for two reasons. First, many JavaScript programs are written against a...
176
click to vote
CICLING
2004
Springer
15 years 12 months ago
2004
Springer
Abstract. In order to extend the application domain of natural language interfaces to more realistic tasks without the decrease of user’s performance, it is desirable for users t...
167
click to vote
TPHOL
2002
IEEE
15 years 11 months ago
2002
IEEE
Abstract. This paper describes a formalization of the weakest precondition, wp, for general recursive programs using the type-theoretical proof assistant Coq. The formalization is ...