4767 search results - page 443 / 954 » Structures for Abstract Rewriting |
189
click to vote
CADE
2010
Springer
15 years 8 months ago
2010
Springer
Beluga is an environment for programming and reasoning about formal systems given by axioms and inference rules. It implements the logical framework LF for specifying and prototypi...
184
click to vote
ICFP
2010
ACM
15 years 8 months ago
2010
ACM
' abstraction theorem shows how a typing judgement in System F can be translated into a relational statement (in second order predicate logic) about inhabitants of the type. ...
171
click to vote
ENGL
2008
15 years 7 months ago
2008
With the advent of System-On-Chip (SOC) technology, there is a pressing need to enhance the quality of ools available and increase the level of abstraction at which hardware is des...
182
click to vote
CORR
2006
Springer
15 years 6 months ago
2006
Springer
The well-known problem of state space explosion in model checking is even more critical when applying this technique to programming languages, mainly due to the presence of complex...
173
click to vote
ENTCS
2006
15 years 6 months ago
2006
Recently, encodings in interaction nets of the call-by-name and call-by-value strategies of the -calculus have been proposed. The purpose of these encodings was to he gap between ...