Pure type systems with de Bruijn indices
Nowadays, type theory has many applications and is used in many different disciplines. Within computer science, logic and mathematics there are many different type systems. They serve several purposes and are formulated in various ways. A general framework called Pure Type Systems (PTSs) has been in...
Guardado en:
Autores principales: | Kamareddine, F., Ríos, A. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_00104620_v45_n2_p187_Kamareddine |
Aporte de: |
Ejemplares similares
-
Pure type systems with de Bruijn indices
Publicado: (2002) -
Interpretability of first-order linear temporal logics in fork algebras
Publicado: (2006) -
Interpretability of first-order linear temporal logics in fork algebras
por: Frias, M.F., et al. -
Satisfiability calculus: The semantic counterpart of a proof calculus in general logics
por: López Pombo, Carlos Gustavo
Publicado: (2013) -
Satisfiability calculus: The semantic counterpart of a proof calculus in general logics
por: Lopez Pombo, C.G., et al.