Peter J. Freyd

Affiliations:
  • University of Pennsylvania, Philadelphia, PA, USA


According to our database1, Peter J. Freyd authored at least 20 papers between 1987 and 2007.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2007
Core algebra revisited.
Theor. Comput. Sci., 2007

2004
Erratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160].
Theor. Comput. Sci., 2004

2003
A new framework for declarative programming.
Theor. Comput. Sci., 2003

2002
Cartesian logic.
Theor. Comput. Sci., 2002

1999
Bireflectivity.
Theor. Comput. Sci., 1999

Path Integrals, Bayesian Vision, and Is Gaussian Quadrature Really Good?
Proceedings of the Conference on Category Theory and Computer Science, 1999

1996
A New Framework for Declarative Programming: Categorial Perspectives.
Proceedings of the Extensions of Logic Programming, 5th International Workshop, 1996

1995
Bireflectivity.
Proceedings of the Eleventh Annual Conference on Mathematical Foundations of Programming Semantics, 1995

1994
Logic Programming in Tau Categories.
Proceedings of the Computer Science Logic, 8th International Workshop, 1994

1993
Structural Polymorphism.
Theor. Comput. Sci., 1993

1992
Extensional PERs
Inf. Comput., June, 1992

Functorial Parametricity
Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

1990
Functorial Polymorphism.
Theor. Comput. Sci., 1990

Recursive Types Reduced to Inductive Types
Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

Categories, allegories.
North-Holland mathematical library 39, North-Holland, ISBN: 978-0-444-70368-2, 1990

1988
Semantic Parametricity in Polymorphic Lambda Calculus
Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS '88), 1988

1987
Lindenbaum algebras of intuitionistic theories and free categories.
Ann. Pure Appl. Log., 1987

Choice and well-ordering.
Ann. Pure Appl. Log., 1987

A Categorical Approach to Realizability and Polymorphic Types.
Proceedings of the Mathematical Foundations of Programming Language Semantics, 1987

Some Semantic Aspects of Polymorphic Lambda Calculus
Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987


  Loading...