-
1
-
-
84859990784
-
On irrelevance and algorithmic equality in predicative type theory
-
A. Abel and G. Scherer. On irrelevance and algorithmic equality in predicative type theory. Logical Methods in Computer Science, 8(1), 2012.
-
(2012)
Logical Methods in Computer Science
, vol.8
, Issue.1
-
-
Abel, A.1
Scherer, G.2
-
3
-
-
47249123760
-
The implicit calculus of constructions as a programming language with dependent types
-
volume 4962 of LNCS
-
B. Barras and B. Bernardo. The implicit calculus of constructions as a programming language with dependent types. In FoSSaCS, volume 4962 of LNCS, pages 365-379, 2008.
-
(2008)
FoSSaCS
, pp. 365-379
-
-
Barras, B.1
Bernardo, B.2
-
5
-
-
33745120551
-
Inductive families need not store their indices
-
volume 3085 of LNCS, Springer
-
E. Brady, C. McBride, and J. McKinna. Inductive families need not store their indices. In TYPES, volume 3085 of LNCS, pages 115-129. Springer, 2003.
-
(2003)
TYPES
, pp. 115-129
-
-
Brady, E.1
McBride, C.2
McKinna, J.3
-
6
-
-
33646170863
-
ATS: A language that combines programming with theorem proving
-
volume 3717 of LNCS, Springer
-
S. Cui, K. Donnelly, and H. Xi. ATS: A language that combines programming with theorem proving. In FroCoS, volume 3717 of LNCS, pages 310-320. Springer, 2005.
-
(2005)
FroCoS
, pp. 310-320
-
-
Cui, S.1
Donnelly, K.2
Xi, H.3
-
7
-
-
84867514917
-
Dependently typed programming with singletons
-
ACM
-
R. A. Eisenberg and S.Weirich. Dependently typed programming with singletons. In Haskell, pages 117-130. ACM, 2012.
-
(2012)
Haskell
, pp. 117-130
-
-
Eisenberg, R.A.1
Weirich, S.2
-
8
-
-
0031321493
-
The Zipper
-
G. P. Huet. The Zipper. J. Funct. Program., 7(5):549-554, 1997.
-
(1997)
J. Funct. Program.
, vol.7
, Issue.5
, pp. 549-554
-
-
Huet, G.P.1
-
9
-
-
84885593920
-
Lightweight static resources: Sexy types for embedded and systems programming
-
O. Kiselyov and C.-c. Shan. Lightweight static resources: Sexy types for embedded and systems programming. In TFP, 2007.
-
(2007)
TFP
-
-
Kiselyov, O.1
Shan, C.-C.2
-
10
-
-
84867500326
-
The right kind of generic programming
-
ACM
-
J. P. Magalhães. The right kind of generic programming. In WGP, pages 13-24. ACM, 2012.
-
(2012)
WGP
, pp. 13-24
-
-
Magalhães, J.P.1
-
15
-
-
36749025106
-
Applicative programming with effects
-
C. McBride and R. Paterson. Applicative programming with effects. J. Funct. Program., 18(1):1-13, 2008.
-
(2008)
J. Funct. Program.
, vol.18
, Issue.1
, pp. 1-13
-
-
McBride, C.1
Paterson, R.2
-
16
-
-
0018105622
-
A theory of type polymorphism in programming
-
R. Milner. A theory of type polymorphism in programming. J. Comput. Syst. Sci., 17(3):348-375, 1978.
-
(1978)
J. Comput. Syst. Sci.
, vol.17
, Issue.3
, pp. 348-375
-
-
Milner, R.1
-
18
-
-
84888873920
-
The implicit calculus of constructions
-
LNCS, Springer
-
A. Miquel. The implicit calculus of constructions. In TLCA, LNCS, pages 344-359. Springer, 2001.
-
(2001)
TLCA
, pp. 344-359
-
-
Miquel, A.1
-
19
-
-
77950909052
-
Singleton types here, singleton types there, singleton types everywhere
-
ACM
-
S. Monnier and D. Haguenauer. Singleton types here, singleton types there, singleton types everywhere. In PLPV, pages 1-8. ACM, 2010.
-
(2010)
PLPV
, pp. 1-8
-
-
Monnier, S.1
Haguenauer, D.2
-
21
-
-
0347255992
-
Extracting F!'s programs from proofs in the Calculus of Constructions
-
ACM
-
C. Paulin-Mohring. Extracting F!'s programs from proofs in the Calculus of Constructions. In POPL. ACM, 1989.
-
(1989)
POPL
-
-
Paulin-Mohring, C.1
-
23
-
-
0036051192
-
Separation logic: A logic for shared mutable data structures
-
IEEE Computer Society
-
J. C. Reynolds. Separation logic: A logic for shared mutable data structures. In LICS, pages 55-74. IEEE Computer Society, 2002.
-
(2002)
LICS
, pp. 55-74
-
-
Reynolds, J.C.1
-
24
-
-
34548310375
-
System F with type equality coercions
-
ACM
-
M. Sulzmann, M. M. T. Chakravarty, S. L. P. Jones, and K. Donnelly. System F with type equality coercions. In TLDI, pages 53-66. ACM, 2007.
-
(2007)
TLDI
, pp. 53-66
-
-
Sulzmann, M.1
Chakravarty, M.M.T.2
Jones, S.L.P.3
Donnelly, K.4
-
25
-
-
0024864871
-
How to make ad-hoc polymorphism less adhoc
-
ACM
-
P. Wadler and S. Blott. How to make ad-hoc polymorphism less adhoc. In POPL, pages 60-76. ACM, 1989.
-
(1989)
POPL
, pp. 60-76
-
-
Wadler, P.1
Blott, S.2
-
26
-
-
84885629965
-
Towards dependently typed Haskell: System FC with kind equality
-
ACM
-
S. Weirich, J. Hsu, and R. A. Eisenberg. Towards dependently typed Haskell: System FC with kind equality. In ICFP. ACM, 2013.
-
(2013)
ICFP
-
-
Weirich, S.1
Hsu, J.2
Eisenberg, R.A.3
-
27
-
-
84857812135
-
Giving Haskell a promotion
-
ACM
-
B. A. Yorgey, S. Weirich, J. Cretin, S. L. Peyton Jones, D. Vytiniotis, and J. P. Magalhães. Giving Haskell a promotion. In TLDI, pages 53-66. ACM, 2012.
-
(2012)
TLDI
, pp. 53-66
-
-
Yorgey, B.A.1
Weirich, S.2
Cretin, J.3
Jones, S.L.P.4
Vytiniotis, D.5
Magalhães, J.P.6
|