Sciweavers

18429 search results - page 235 / 3686
» Typing dynamic typing
Sort
View
WADT
2004
Springer
15 years 12 months ago
Type Class Polymorphism in an Institutional Framework
Higher-order logic with shallow type class polymorphism is widely used as a specification formalism. Its polymorphic entities (types, operators, axioms) can easily be equipped wit...
Lutz Schröder, Till Mossakowski, Christoph L&...
IMR
2003
Springer
15 years 11 months ago
A New Type of Size Function Respecting Premeshed Entities
This paper describes the creation of a new type of size function – the mesh size function that honors the existing mesh on premeshed geometry entities and radiates the mesh size...
Jin Zhu
TPHOL
2000
IEEE
15 years 11 months ago
Proof Terms for Simply Typed Higher Order Logic
Abstract. This paper presents proof terms for simply typed, intuitionistic higher order logic, a popular logical framework. Unification-based algorithms for the compression and re...
Stefan Berghofer, Tobias Nipkow
TPHOL
1992
IEEE
15 years 10 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
CAV
2006
Springer
165views Hardware» more  CAV 2006»
15 years 10 months ago
Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study
Many multithreaded programs employ concurrent data types to safely share data among threads. However, highly-concurrent algorithms for even seemingly simple data types are difficul...
Sebastian Burckhardt, Rajeev Alur, Milo M. K. Mart...