Sciweavers

7529 search results - page 17 / 1506
» The Modula-3 Type System
Sort
View
FUIN
2010
156views more  FUIN 2010»
13 years 6 months ago
A Tutorial Implementation of a Dependently Typed Lambda Calculus
Abstract. We present the type rules for a dependently typed core calculus together with a straightforward implementation in Haskell. We explicitly highlight the changes necessary t...
Andres Löh, Conor McBride, Wouter Swierstra
CORR
2011
Springer
173views Education» more  CORR 2011»
13 years 2 months ago
Linear Dependent Types and Relative Completeness
—A system of linear dependent types for the lambda calculus with full higher-order recursion, called d PCF, is introduced and proved sound and relatively complete. Completeness h...
Ugo Dal Lago, Marco Gaboardi
ENTCS
2007
126views more  ENTCS 2007»
13 years 7 months ago
Context Dependent Procedures and Computed Types in -eriFun
We present two enhancements of the functional language L which is used in the eriFun system to write programs and formulate statements about them. Context dependent procedures all...
Andreas Schlosser, Christoph Walther, Michael Gond...
EUSFLAT
2009
137views Fuzzy Logic» more  EUSFLAT 2009»
13 years 5 months ago
Novel Methods for the Design of General Type-2 Fuzzy Sets based on Device Characteristics and Linguistic Labels Surveys
Fuzzy Logic Systems are widely recognized to be successful at modelling uncertainty in a large variety of applications. While recently interval type-2 fuzzy logic has been credited...
Christian Wagner, Hani Hagras
ENTCS
2000
80views more  ENTCS 2000»
13 years 7 months ago
The simply typed rewriting calculus
The rewriting calculus is a rule construction and application framework. As such it embeds in a uniform way term rewriting and lambda-calculus. Since rule application is an explic...
Horatiu Cirstea, Claude Kirchner